./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa1019154e40d47bb37715d3eeac2054a52cf6d54f3dc9d5d7f27932730291e6 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:59,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:59,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:15:59,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:59,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:59,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:59,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:59,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:59,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:59,302 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:59,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:59,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:59,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:59,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:59,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:59,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:59,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:59,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:59,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:59,306 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa1019154e40d47bb37715d3eeac2054a52cf6d54f3dc9d5d7f27932730291e6 [2025-04-29 11:15:59,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:59,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:59,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:59,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:59,527 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:59,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.c [2025-04-29 11:16:00,837 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c0fbb7/173dc897573a424784cd136af2744270/FLAGbd32eba23 [2025-04-29 11:16:01,022 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:16:01,023 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.c [2025-04-29 11:16:01,024 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:01,025 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:01,025 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:16:01,031 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c0fbb7/173dc897573a424784cd136af2744270/FLAGbd32eba23 [2025-04-29 11:16:01,837 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82c0fbb7/173dc897573a424784cd136af2744270 [2025-04-29 11:16:01,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:16:01,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:16:01,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:01,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:16:01,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:16:01,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:01" (1/1) ... [2025-04-29 11:16:01,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa416aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:01, skipping insertion in model container [2025-04-29 11:16:01,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:16:01" (1/1) ... [2025-04-29 11:16:01,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:16:02,037 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:02,054 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:16:02,090 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:16:02,106 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:16:02,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02 WrapperNode [2025-04-29 11:16:02,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:16:02,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:02,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:16:02,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:16:02,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,149 INFO L138 Inliner]: procedures = 20, calls = 55, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 186 [2025-04-29 11:16:02,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:16:02,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:16:02,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:16:02,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:16:02,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,182 INFO L175 MemorySlicer]: Split 50 memory accesses to 3 slices as follows [10, 16, 24]. 48 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [10, 10, 0]. The 19 writes are split as follows [0, 1, 18]. [2025-04-29 11:16:02,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:16:02,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:16:02,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:16:02,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:16:02,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (1/1) ... [2025-04-29 11:16:02,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:16:02,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:02,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:16:02,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:16:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:16:02,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:16:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:16:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:16:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:16:02,259 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:16:02,260 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:16:02,345 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:16:02,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:16:02,759 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:16:02,760 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:16:02,964 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:16:02,964 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:16:02,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:02 BoogieIcfgContainer [2025-04-29 11:16:02,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:16:02,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:16:02,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:16:02,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:16:02,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:16:01" (1/3) ... [2025-04-29 11:16:02,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ca2d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:02, skipping insertion in model container [2025-04-29 11:16:02,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:16:02" (2/3) ... [2025-04-29 11:16:02,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ca2d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:16:02, skipping insertion in model container [2025-04-29 11:16:02,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:16:02" (3/3) ... [2025-04-29 11:16:02,973 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.c [2025-04-29 11:16:02,983 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:16:02,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.c that has 2 procedures, 107 locations, 106 edges, 1 initial locations, 1 loop locations, and 61 error locations. [2025-04-29 11:16:02,984 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:16:03,031 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:16:03,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 218 flow [2025-04-29 11:16:03,097 INFO L116 PetriNetUnfolderBase]: 1/106 cut-off events. [2025-04-29 11:16:03,098 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:03,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 1/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2025-04-29 11:16:03,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 218 flow [2025-04-29 11:16:03,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 215 flow [2025-04-29 11:16:03,110 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:16:03,117 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3f5572e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:16:03,118 INFO L341 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-04-29 11:16:03,120 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:16:03,120 INFO L116 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-04-29 11:16:03,120 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:03,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:16:03,121 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:03,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash 578615, now seen corresponding path program 1 times [2025-04-29 11:16:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545941449] [2025-04-29 11:16:03,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:16:03,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:16:03,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545941449] [2025-04-29 11:16:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545941449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:03,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358341480] [2025-04-29 11:16:03,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:03,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:03,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 107 [2025-04-29 11:16:03,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 107 [2025-04-29 11:16:03,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,583 INFO L116 PetriNetUnfolderBase]: 64/294 cut-off events. [2025-04-29 11:16:03,583 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:03,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 294 events. 64/294 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1349 event pairs, 63 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 377. Up to 157 conditions per place. [2025-04-29 11:16:03,586 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 30 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2025-04-29 11:16:03,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 275 flow [2025-04-29 11:16:03,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2025-04-29 11:16:03,595 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7133956386292835 [2025-04-29 11:16:03,596 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 215 flow. Second operand 3 states and 229 transitions. [2025-04-29 11:16:03,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 275 flow [2025-04-29 11:16:03,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:03,601 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 214 flow [2025-04-29 11:16:03,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2025-04-29 11:16:03,605 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-04-29 11:16:03,605 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 214 flow [2025-04-29 11:16:03,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:16:03,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:16:03,606 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:03,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 578616, now seen corresponding path program 1 times [2025-04-29 11:16:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545986234] [2025-04-29 11:16:03,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:16:03,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:16:03,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545986234] [2025-04-29 11:16:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545986234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850678868] [2025-04-29 11:16:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:03,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:03,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:03,798 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 107 [2025-04-29 11:16:03,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 107 [2025-04-29 11:16:03,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,933 INFO L116 PetriNetUnfolderBase]: 64/286 cut-off events. [2025-04-29 11:16:03,933 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:16:03,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 286 events. 64/286 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 63 based on Foata normal form. 8/228 useless extension candidates. Maximal degree in co-relation 396. Up to 157 conditions per place. [2025-04-29 11:16:03,939 INFO L140 encePairwiseOnDemand]: 91/107 looper letters, 26 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2025-04-29 11:16:03,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 266 flow [2025-04-29 11:16:03,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-04-29 11:16:03,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7383177570093458 [2025-04-29 11:16:03,943 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 214 flow. Second operand 3 states and 237 transitions. [2025-04-29 11:16:03,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 266 flow [2025-04-29 11:16:03,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:03,945 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 198 flow [2025-04-29 11:16:03,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-04-29 11:16:03,947 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-04-29 11:16:03,947 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 198 flow [2025-04-29 11:16:03,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:16:03,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:16:03,948 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:03,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 556066950, now seen corresponding path program 1 times [2025-04-29 11:16:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312266472] [2025-04-29 11:16:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:16:03,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:16:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312266472] [2025-04-29 11:16:04,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312266472] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:04,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:04,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598048767] [2025-04-29 11:16:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:04,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:04,329 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-04-29 11:16:04,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:04,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:04,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-04-29 11:16:04,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,432 INFO L116 PetriNetUnfolderBase]: 73/302 cut-off events. [2025-04-29 11:16:04,432 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:16:04,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 302 events. 73/302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1370 event pairs, 72 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 434. Up to 183 conditions per place. [2025-04-29 11:16:04,436 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 38 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2025-04-29 11:16:04,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 264 flow [2025-04-29 11:16:04,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2025-04-29 11:16:04,440 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.719626168224299 [2025-04-29 11:16:04,440 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 198 flow. Second operand 3 states and 231 transitions. [2025-04-29 11:16:04,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 84 transitions, 264 flow [2025-04-29 11:16:04,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:04,442 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 172 flow [2025-04-29 11:16:04,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-04-29 11:16:04,442 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-04-29 11:16:04,442 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 172 flow [2025-04-29 11:16:04,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.833333333333336) internal successors, (377), 6 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:04,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:16:04,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:16:04,445 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:04,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 556066951, now seen corresponding path program 1 times [2025-04-29 11:16:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080750306] [2025-04-29 11:16:04,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:16:04,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:16:04,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:04,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080750306] [2025-04-29 11:16:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080750306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468985830] [2025-04-29 11:16:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:04,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:04,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 107 [2025-04-29 11:16:04,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:04,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:04,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 107 [2025-04-29 11:16:04,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,927 INFO L116 PetriNetUnfolderBase]: 64/291 cut-off events. [2025-04-29 11:16:04,927 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:16:04,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 291 events. 64/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1213 event pairs, 63 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 460. Up to 163 conditions per place. [2025-04-29 11:16:04,929 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 37 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-04-29 11:16:04,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 272 flow [2025-04-29 11:16:04,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:16:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:16:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-04-29 11:16:04,930 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6401869158878505 [2025-04-29 11:16:04,931 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 172 flow. Second operand 4 states and 274 transitions. [2025-04-29 11:16:04,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 272 flow [2025-04-29 11:16:04,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:04,935 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 219 flow [2025-04-29 11:16:04,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-04-29 11:16:04,936 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -17 predicate places. [2025-04-29 11:16:04,936 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 219 flow [2025-04-29 11:16:04,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:04,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:04,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:16:04,937 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:04,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1124171614, now seen corresponding path program 1 times [2025-04-29 11:16:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290675116] [2025-04-29 11:16:04,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:04,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:04,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:05,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290675116] [2025-04-29 11:16:05,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290675116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:05,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:05,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723562209] [2025-04-29 11:16:05,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:05,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:05,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:05,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:05,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 107 [2025-04-29 11:16:05,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:05,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:05,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 107 [2025-04-29 11:16:05,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:05,622 INFO L116 PetriNetUnfolderBase]: 64/285 cut-off events. [2025-04-29 11:16:05,622 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:16:05,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 285 events. 64/285 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1203 event pairs, 63 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 482. Up to 154 conditions per place. [2025-04-29 11:16:05,624 INFO L140 encePairwiseOnDemand]: 90/107 looper letters, 30 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2025-04-29 11:16:05,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 85 transitions, 307 flow [2025-04-29 11:16:05,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:16:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 463 transitions. [2025-04-29 11:16:05,627 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5408878504672897 [2025-04-29 11:16:05,627 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 219 flow. Second operand 8 states and 463 transitions. [2025-04-29 11:16:05,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 85 transitions, 307 flow [2025-04-29 11:16:05,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:05,629 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 245 flow [2025-04-29 11:16:05,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2025-04-29 11:16:05,629 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2025-04-29 11:16:05,629 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 245 flow [2025-04-29 11:16:05,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:05,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:05,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:05,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:16:05,630 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:05,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1124171613, now seen corresponding path program 1 times [2025-04-29 11:16:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:05,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423294912] [2025-04-29 11:16:05,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:16:05,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:16:05,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:05,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423294912] [2025-04-29 11:16:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423294912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278377539] [2025-04-29 11:16:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:05,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:05,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:06,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 107 [2025-04-29 11:16:06,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:06,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 107 [2025-04-29 11:16:06,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:06,586 INFO L116 PetriNetUnfolderBase]: 64/281 cut-off events. [2025-04-29 11:16:06,586 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:16:06,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 281 events. 64/281 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1203 event pairs, 63 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 494. Up to 158 conditions per place. [2025-04-29 11:16:06,587 INFO L140 encePairwiseOnDemand]: 95/107 looper letters, 32 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2025-04-29 11:16:06,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 83 transitions, 335 flow [2025-04-29 11:16:06,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 373 transitions. [2025-04-29 11:16:06,589 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4979973297730307 [2025-04-29 11:16:06,589 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 245 flow. Second operand 7 states and 373 transitions. [2025-04-29 11:16:06,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 83 transitions, 335 flow [2025-04-29 11:16:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 299 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:16:06,590 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 235 flow [2025-04-29 11:16:06,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-04-29 11:16:06,591 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -18 predicate places. [2025-04-29 11:16:06,591 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 235 flow [2025-04-29 11:16:06,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.285714285714285) internal successors, (338), 7 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:06,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:06,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:06,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:06,592 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:06,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2002858368, now seen corresponding path program 1 times [2025-04-29 11:16:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:06,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37636928] [2025-04-29 11:16:06,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:06,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:06,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:06,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:06,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:06,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37636928] [2025-04-29 11:16:06,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37636928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:06,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:06,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:06,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769588049] [2025-04-29 11:16:06,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:06,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:06,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:06,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:06,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:06,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 107 [2025-04-29 11:16:06,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:06,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:06,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 107 [2025-04-29 11:16:06,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:07,011 INFO L116 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-04-29 11:16:07,012 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-29 11:16:07,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 279 events. 64/279 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1191 event pairs, 63 based on Foata normal form. 2/233 useless extension candidates. Maximal degree in co-relation 481. Up to 158 conditions per place. [2025-04-29 11:16:07,013 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 26 selfloop transitions, 15 changer transitions 0/82 dead transitions. [2025-04-29 11:16:07,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 315 flow [2025-04-29 11:16:07,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2025-04-29 11:16:07,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6485981308411215 [2025-04-29 11:16:07,018 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 235 flow. Second operand 5 states and 347 transitions. [2025-04-29 11:16:07,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 315 flow [2025-04-29 11:16:07,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 285 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:16:07,019 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 233 flow [2025-04-29 11:16:07,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-04-29 11:16:07,019 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2025-04-29 11:16:07,020 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 233 flow [2025-04-29 11:16:07,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:07,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:07,020 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:07,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:07,020 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:07,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2002858367, now seen corresponding path program 1 times [2025-04-29 11:16:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:07,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217531445] [2025-04-29 11:16:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:07,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:16:07,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:16:07,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:07,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217531445] [2025-04-29 11:16:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217531445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:07,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:07,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:07,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906696928] [2025-04-29 11:16:07,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:07,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:07,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:07,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:07,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:07,253 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 107 [2025-04-29 11:16:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:07,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 107 [2025-04-29 11:16:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:07,360 INFO L116 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-04-29 11:16:07,360 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-29 11:16:07,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 277 events. 64/277 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 63 based on Foata normal form. 2/231 useless extension candidates. Maximal degree in co-relation 485. Up to 158 conditions per place. [2025-04-29 11:16:07,361 INFO L140 encePairwiseOnDemand]: 96/107 looper letters, 30 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2025-04-29 11:16:07,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 321 flow [2025-04-29 11:16:07,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 331 transitions. [2025-04-29 11:16:07,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6186915887850467 [2025-04-29 11:16:07,365 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 233 flow. Second operand 5 states and 331 transitions. [2025-04-29 11:16:07,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 321 flow [2025-04-29 11:16:07,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 291 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:07,368 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 231 flow [2025-04-29 11:16:07,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-04-29 11:16:07,369 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2025-04-29 11:16:07,370 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 231 flow [2025-04-29 11:16:07,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:07,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:07,371 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:07,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:16:07,371 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:07,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1718222270, now seen corresponding path program 1 times [2025-04-29 11:16:07,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:07,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856370182] [2025-04-29 11:16:07,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:07,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:07,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:07,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:07,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856370182] [2025-04-29 11:16:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856370182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:07,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084569889] [2025-04-29 11:16:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:07,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:07,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:07,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:07,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:16:07,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:07,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:07,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:07,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:16:07,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:07,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:07,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:07,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:07,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:07,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:07,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:08,196 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:08,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-04-29 11:16:08,273 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:08,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084569889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:08,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2025-04-29 11:16:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439108667] [2025-04-29 11:16:08,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:08,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:16:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:16:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:16:09,988 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 107 [2025-04-29 11:16:09,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 231 flow. Second operand has 16 states, 16 states have (on average 58.0625) internal successors, (929), 16 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:09,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:09,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 107 [2025-04-29 11:16:09,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:10,361 INFO L116 PetriNetUnfolderBase]: 75/329 cut-off events. [2025-04-29 11:16:10,361 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-29 11:16:10,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 329 events. 75/329 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1440 event pairs, 72 based on Foata normal form. 6/281 useless extension candidates. Maximal degree in co-relation 599. Up to 178 conditions per place. [2025-04-29 11:16:10,363 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 50 selfloop transitions, 12 changer transitions 0/101 dead transitions. [2025-04-29 11:16:10,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 101 transitions, 459 flow [2025-04-29 11:16:10,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 461 transitions. [2025-04-29 11:16:10,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6154873164218959 [2025-04-29 11:16:10,364 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 231 flow. Second operand 7 states and 461 transitions. [2025-04-29 11:16:10,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 101 transitions, 459 flow [2025-04-29 11:16:10,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 101 transitions, 393 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:10,366 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 297 flow [2025-04-29 11:16:10,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-04-29 11:16:10,367 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -16 predicate places. [2025-04-29 11:16:10,367 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 297 flow [2025-04-29 11:16:10,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 58.0625) internal successors, (929), 16 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:10,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:10,368 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:16:10,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:16:10,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,572 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:10,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash 290073341, now seen corresponding path program 1 times [2025-04-29 11:16:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:10,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697003988] [2025-04-29 11:16:10,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:10,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:16:10,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:16:10,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:10,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:10,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:10,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697003988] [2025-04-29 11:16:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697003988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:10,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400486132] [2025-04-29 11:16:10,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:10,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:10,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:10,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:16:10,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:16:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:16:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:10,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:10,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:10,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400486132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:10,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-29 11:16:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514316404] [2025-04-29 11:16:10,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:10,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:16:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:10,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:16:10,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:16:10,934 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-04-29 11:16:10,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 297 flow. Second operand has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:10,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:10,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-04-29 11:16:10,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:11,077 INFO L116 PetriNetUnfolderBase]: 64/318 cut-off events. [2025-04-29 11:16:11,078 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-29 11:16:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 318 events. 64/318 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1149 event pairs, 63 based on Foata normal form. 4/274 useless extension candidates. Maximal degree in co-relation 599. Up to 154 conditions per place. [2025-04-29 11:16:11,079 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 62 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2025-04-29 11:16:11,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 533 flow [2025-04-29 11:16:11,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:16:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 658 transitions. [2025-04-29 11:16:11,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7686915887850467 [2025-04-29 11:16:11,081 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 297 flow. Second operand 8 states and 658 transitions. [2025-04-29 11:16:11,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 533 flow [2025-04-29 11:16:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 521 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:11,084 INFO L231 Difference]: Finished difference. Result has 102 places, 90 transitions, 321 flow [2025-04-29 11:16:11,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=102, PETRI_TRANSITIONS=90} [2025-04-29 11:16:11,084 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-04-29 11:16:11,084 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 321 flow [2025-04-29 11:16:11,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.55555555555556) internal successors, (698), 9 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:11,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:11,085 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-04-29 11:16:11,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:16:11,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:16:11,289 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:11,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -382075661, now seen corresponding path program 2 times [2025-04-29 11:16:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:11,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370237451] [2025-04-29 11:16:11,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:11,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:16:11,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:16:11,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:11,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:12,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370237451] [2025-04-29 11:16:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370237451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:12,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421597264] [2025-04-29 11:16:12,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:12,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:12,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:12,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:16:12,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:16:12,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:16:12,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:12,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:12,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-29 11:16:12,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:12,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:12,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,004 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:13,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:13,021 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:13,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:16:13,175 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:13,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:13,191 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:13,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:16:13,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:13,258 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-29 11:16:13,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2025-04-29 11:16:13,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:13,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:13,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:13,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:13,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:13,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:13,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:13,884 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:13,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:13,980 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:13,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,119 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:14,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,200 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:14,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,345 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:14,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,429 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:14,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,581 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:14,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,666 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:14,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421597264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:14,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:14,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 49 [2025-04-29 11:16:14,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297334894] [2025-04-29 11:16:14,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:14,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-29 11:16:14,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:14,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-29 11:16:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=2088, Unknown=0, NotChecked=0, Total=2550 [2025-04-29 11:16:23,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 107 [2025-04-29 11:16:23,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 321 flow. Second operand has 51 states, 51 states have (on average 54.90196078431372) internal successors, (2800), 51 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:23,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:23,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 107 [2025-04-29 11:16:23,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:24,299 INFO L116 PetriNetUnfolderBase]: 77/391 cut-off events. [2025-04-29 11:16:24,299 INFO L117 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-04-29 11:16:24,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 391 events. 77/391 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1516 event pairs, 72 based on Foata normal form. 6/346 useless extension candidates. Maximal degree in co-relation 820. Up to 182 conditions per place. [2025-04-29 11:16:24,301 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 71 selfloop transitions, 37 changer transitions 0/145 dead transitions. [2025-04-29 11:16:24,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 145 transitions, 871 flow [2025-04-29 11:16:24,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:16:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 11:16:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1333 transitions. [2025-04-29 11:16:24,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416497358797236 [2025-04-29 11:16:24,304 INFO L175 Difference]: Start difference. First operand has 102 places, 90 transitions, 321 flow. Second operand 23 states and 1333 transitions. [2025-04-29 11:16:24,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 145 transitions, 871 flow [2025-04-29 11:16:24,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 145 transitions, 855 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-29 11:16:24,307 INFO L231 Difference]: Finished difference. Result has 132 places, 111 transitions, 637 flow [2025-04-29 11:16:24,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=637, PETRI_PLACES=132, PETRI_TRANSITIONS=111} [2025-04-29 11:16:24,307 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places. [2025-04-29 11:16:24,307 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 111 transitions, 637 flow [2025-04-29 11:16:24,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 54.90196078431372) internal successors, (2800), 51 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:24,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:24,308 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-04-29 11:16:24,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:16:24,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:24,512 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:24,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1083494761, now seen corresponding path program 2 times [2025-04-29 11:16:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:24,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038828007] [2025-04-29 11:16:24,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:24,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:16:24,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:16:24,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:24,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-04-29 11:16:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:24,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038828007] [2025-04-29 11:16:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038828007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:24,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:24,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923162277] [2025-04-29 11:16:24,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:24,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:24,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:24,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:25,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 107 [2025-04-29 11:16:25,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 111 transitions, 637 flow. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:25,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:25,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 107 [2025-04-29 11:16:25,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:25,260 INFO L116 PetriNetUnfolderBase]: 116/563 cut-off events. [2025-04-29 11:16:25,260 INFO L117 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2025-04-29 11:16:25,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 563 events. 116/563 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2924 event pairs, 36 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 1182. Up to 161 conditions per place. [2025-04-29 11:16:25,262 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 60 selfloop transitions, 26 changer transitions 0/124 dead transitions. [2025-04-29 11:16:25,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 124 transitions, 835 flow [2025-04-29 11:16:25,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:16:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 438 transitions. [2025-04-29 11:16:25,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6822429906542056 [2025-04-29 11:16:25,264 INFO L175 Difference]: Start difference. First operand has 132 places, 111 transitions, 637 flow. Second operand 6 states and 438 transitions. [2025-04-29 11:16:25,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 124 transitions, 835 flow [2025-04-29 11:16:25,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 711 flow, removed 39 selfloop flow, removed 10 redundant places. [2025-04-29 11:16:25,269 INFO L231 Difference]: Finished difference. Result has 127 places, 112 transitions, 580 flow [2025-04-29 11:16:25,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=127, PETRI_TRANSITIONS=112} [2025-04-29 11:16:25,270 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 18 predicate places. [2025-04-29 11:16:25,271 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 112 transitions, 580 flow [2025-04-29 11:16:25,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 6 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:25,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:25,271 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:25,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:16:25,272 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:25,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -771400223, now seen corresponding path program 1 times [2025-04-29 11:16:25,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:25,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398390438] [2025-04-29 11:16:25,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:25,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:16:25,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:16:25,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:25,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:25,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:25,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398390438] [2025-04-29 11:16:25,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398390438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:25,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493966535] [2025-04-29 11:16:25,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:25,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:25,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:25,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:16:25,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:16:25,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:16:25,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:25,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:25,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:25,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:25,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:25,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493966535] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:25,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-29 11:16:25,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056944610] [2025-04-29 11:16:25,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:25,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:25,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:25,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:25,992 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2025-04-29 11:16:25,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 112 transitions, 580 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:25,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:25,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2025-04-29 11:16:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:26,190 INFO L116 PetriNetUnfolderBase]: 95/483 cut-off events. [2025-04-29 11:16:26,190 INFO L117 PetriNetUnfolderBase]: For 495/495 co-relation queries the response was YES. [2025-04-29 11:16:26,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 483 events. 95/483 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2067 event pairs, 87 based on Foata normal form. 4/413 useless extension candidates. Maximal degree in co-relation 1045. Up to 220 conditions per place. [2025-04-29 11:16:26,194 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 89 selfloop transitions, 12 changer transitions 0/141 dead transitions. [2025-04-29 11:16:26,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 141 transitions, 948 flow [2025-04-29 11:16:26,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:16:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:16:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 978 transitions. [2025-04-29 11:16:26,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7616822429906542 [2025-04-29 11:16:26,196 INFO L175 Difference]: Start difference. First operand has 127 places, 112 transitions, 580 flow. Second operand 12 states and 978 transitions. [2025-04-29 11:16:26,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 141 transitions, 948 flow [2025-04-29 11:16:26,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 141 transitions, 912 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-29 11:16:26,201 INFO L231 Difference]: Finished difference. Result has 136 places, 109 transitions, 524 flow [2025-04-29 11:16:26,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=524, PETRI_PLACES=136, PETRI_TRANSITIONS=109} [2025-04-29 11:16:26,202 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 27 predicate places. [2025-04-29 11:16:26,202 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 109 transitions, 524 flow [2025-04-29 11:16:26,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:26,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:26,203 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-04-29 11:16:26,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:16:26,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:26,404 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2025-04-29 11:16:26,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 223600405, now seen corresponding path program 3 times [2025-04-29 11:16:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:26,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400405543] [2025-04-29 11:16:26,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:26,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-04-29 11:16:26,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-04-29 11:16:26,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:16:26,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 409 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:27,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:27,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400405543] [2025-04-29 11:16:27,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400405543] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:27,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316754850] [2025-04-29 11:16:27,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:27,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:27,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:16:27,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. Killed by 15