./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:20:58,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:20:58,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:20:58,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:20:58,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:20:58,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:20:58,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:20:58,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:20:58,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:20:58,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:20:58,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:20:58,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:20:58,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:20:58,470 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:20:58,471 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:20:58,471 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:20:58,472 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:20:58,472 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:20:58,472 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:20:58,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:20:58,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:20:58,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:20:58,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:20:58,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:20:58,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:20:58,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:20:58,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:20:58,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:20:58,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:20:58,477 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:20:58,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:20:58,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:20:58,478 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:20:58,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:20:58,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:20:58,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:20:58,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:20:58,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:20:58,480 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:20:58,480 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(F end) ) 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2024-11-12 21:20:58,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:20:58,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:20:58,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:20:58,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:20:58,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:20:58,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-12 21:21:00,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:21:00,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:21:00,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2024-11-12 21:21:00,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e772b2001/8303906dab59476da44f39032b6ab16e/FLAG45a31edd0 [2024-11-12 21:21:00,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e772b2001/8303906dab59476da44f39032b6ab16e [2024-11-12 21:21:00,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:21:00,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:21:00,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:21:00,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:21:00,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:21:00,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c13a67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00, skipping insertion in model container [2024-11-12 21:21:00,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:21:00,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:21:00,738 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:21:00,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:21:00,774 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:21:00,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00 WrapperNode [2024-11-12 21:21:00,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:21:00,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:21:00,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:21:00,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:21:00,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,811 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 141 [2024-11-12 21:21:00,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:21:00,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:21:00,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:21:00,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:21:00,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,845 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 8 writes are split as follows [0, 3, 5]. [2024-11-12 21:21:00,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:21:00,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:21:00,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:21:00,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:21:00,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (1/1) ... [2024-11-12 21:21:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:00,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:00,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-12 21:21:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:21:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:21:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 21:21:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 21:21:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 21:21:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 21:21:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 21:21:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 21:21:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 21:21:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 21:21:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:21:00,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:21:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 21:21:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 21:21:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 21:21:01,122 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:21:01,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:21:01,454 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-12 21:21:01,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:21:01,471 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:21:01,471 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 21:21:01,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:01 BoogieIcfgContainer [2024-11-12 21:21:01,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:21:01,473 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:21:01,473 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:21:01,478 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:21:01,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:01,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:21:00" (1/3) ... [2024-11-12 21:21:01,481 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7818acc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:21:01, skipping insertion in model container [2024-11-12 21:21:01,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:01,481 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:21:00" (2/3) ... [2024-11-12 21:21:01,481 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7818acc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:21:01, skipping insertion in model container [2024-11-12 21:21:01,482 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:21:01,482 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:21:01" (3/3) ... [2024-11-12 21:21:01,483 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2024-11-12 21:21:01,547 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:21:01,548 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:21:01,548 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:21:01,548 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:21:01,548 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:21:01,548 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:21:01,548 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:21:01,549 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:21:01,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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) [2024-11-12 21:21:01,571 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-12 21:21:01,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:01,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:01,579 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:01,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 21:21:01,579 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:21:01,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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) [2024-11-12 21:21:01,583 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-12 21:21:01,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:01,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:01,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-12 21:21:01,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-12 21:21:01,592 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" [2024-11-12 21:21:01,592 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" [2024-11-12 21:21:01,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-12 21:21:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277838963] [2024-11-12 21:21:01,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:01,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:01,710 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:01,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:01,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-12 21:21:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814130262] [2024-11-12 21:21:01,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:01,800 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:01,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:01,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-12 21:21:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:01,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927909063] [2024-11-12 21:21:01,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:01,887 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:01,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:02,572 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:21:02,573 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:21:02,573 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:21:02,573 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:21:02,573 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:21:02,573 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:02,573 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:21:02,574 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:21:02,574 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2024-11-12 21:21:02,574 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:21:02,574 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:21:02,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:02,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:03,430 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:21:03,435 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:21:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-12 21:21:03,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:03,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:03,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:03,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-12 21:21:03,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-12 21:21:03,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:03,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-12 21:21:03,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-12 21:21:03,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-12 21:21:03,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-12 21:21:03,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:03,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:03,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:03,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-12 21:21:03,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-12 21:21:03,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-12 21:21:03,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,687 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-12 21:21:03,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:03,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-12 21:21:03,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:03,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-12 21:21:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-12 21:21:03,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:03,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:03,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:03,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:03,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:03,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:03,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:03,806 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:21:03,849 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-12 21:21:03,850 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-12 21:21:03,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:03,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:03,854 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:03,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-12 21:21:03,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:21:03,871 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 21:21:03,872 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:21:03,872 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0#1) = 1*v_rep(select #length ~#pp~0.base)_1 - 2*ULTIMATE.start_init_~i~0#1 Supporting invariants [] [2024-11-12 21:21:03,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-12 21:21:03,945 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2024-11-12 21:21:03,955 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-12 21:21:03,956 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-12 21:21:03,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:03,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:21:03,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:04,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 21:21:04,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:21:04,101 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 21:21:04,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-12 21:21:04,159 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Result 72 states and 105 transitions. Complement of second has 6 states. [2024-11-12 21:21:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 21:21:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-12 21:21:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2024-11-12 21:21:04,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-12 21:21:04,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:21:04,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-12 21:21:04,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:21:04,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-12 21:21:04,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:21:04,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2024-11-12 21:21:04,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-11-12 21:21:04,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 34 states and 48 transitions. [2024-11-12 21:21:04,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-11-12 21:21:04,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-12 21:21:04,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2024-11-12 21:21:04,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:04,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-12 21:21:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2024-11-12 21:21:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 21:21:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 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) [2024-11-12 21:21:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-12 21:21:04,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-12 21:21:04,217 INFO L426 stractBuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-12 21:21:04,217 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:21:04,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2024-11-12 21:21:04,219 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2024-11-12 21:21:04,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:04,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:04,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:04,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:04,222 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2024-11-12 21:21:04,222 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2024-11-12 21:21:04,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2024-11-12 21:21:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466030603] [2024-11-12 21:21:04,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:04,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:04,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466030603] [2024-11-12 21:21:04,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466030603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71769149] [2024-11-12 21:21:04,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:04,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:04,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 21:21:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:04,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:21:04,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:04,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71769149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:04,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-12 21:21:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974661648] [2024-11-12 21:21:04,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:04,411 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:21:04,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2024-11-12 21:21:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:04,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989227770] [2024-11-12 21:21:04,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:04,421 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:04,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 21:21:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 21:21:04,501 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-12 21:21:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:04,569 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-12 21:21:04,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2024-11-12 21:21:04,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-12 21:21:04,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 38 transitions. [2024-11-12 21:21:04,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-12 21:21:04,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-12 21:21:04,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-12 21:21:04,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:04,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-12 21:21:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-12 21:21:04,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-12 21:21:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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) [2024-11-12 21:21:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-12 21:21:04,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-12 21:21:04,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-12 21:21:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:21:04,579 INFO L426 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-12 21:21:04,580 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:21:04,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2024-11-12 21:21:04,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-12 21:21:04,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:04,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:04,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:04,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:04,583 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2024-11-12 21:21:04,583 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2024-11-12 21:21:04,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 1 times [2024-11-12 21:21:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813446066] [2024-11-12 21:21:04,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:04,632 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:04,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2024-11-12 21:21:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120787093] [2024-11-12 21:21:04,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:04,671 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:04,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:04,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2024-11-12 21:21:04,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096517926] [2024-11-12 21:21:04,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:04,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:05,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:05,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096517926] [2024-11-12 21:21:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096517926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:05,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754200416] [2024-11-12 21:21:05,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:05,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:05,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:05,259 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:05,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 21:21:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:05,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 21:21:05,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:05,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:05,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:05,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:05,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-12 21:21:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:05,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2024-11-12 21:21:05,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:05,929 INFO L378 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 21 treesize of output 19 [2024-11-12 21:21:05,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 86 [2024-11-12 21:21:05,958 INFO L378 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 17 treesize of output 15 [2024-11-12 21:21:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754200416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:05,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-12 21:21:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450589254] [2024-11-12 21:21:05,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 21:21:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-12 21:21:06,022 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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) [2024-11-12 21:21:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:06,242 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-11-12 21:21:06,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2024-11-12 21:21:06,244 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-12 21:21:06,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2024-11-12 21:21:06,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-12 21:21:06,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-12 21:21:06,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2024-11-12 21:21:06,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:06,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-12 21:21:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2024-11-12 21:21:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-12 21:21:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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) [2024-11-12 21:21:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-12 21:21:06,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-12 21:21:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:21:06,254 INFO L426 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-12 21:21:06,255 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:21:06,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-12 21:21:06,255 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-12 21:21:06,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:06,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:06,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:06,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:06,260 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" [2024-11-12 21:21:06,260 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" [2024-11-12 21:21:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2024-11-12 21:21:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032633198] [2024-11-12 21:21:06,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:06,293 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:06,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:06,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2024-11-12 21:21:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:06,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207622886] [2024-11-12 21:21:06,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:06,326 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:06,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2024-11-12 21:21:06,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:06,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670836700] [2024-11-12 21:21:06,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:06,395 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:06,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:21,957 WARN L286 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 290 DAG size of output: 251 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-12 21:21:22,741 INFO L204 LassoAnalysis]: Preferences: [2024-11-12 21:21:22,742 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-12 21:21:22,742 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-12 21:21:22,742 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-12 21:21:22,742 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-12 21:21:22,742 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:22,742 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-12 21:21:22,742 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-12 21:21:22,742 INFO L132 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration4_Lasso [2024-11-12 21:21:22,742 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-12 21:21:22,743 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-12 21:21:22,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:22,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-12 21:21:23,506 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-12 21:21:23,506 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-12 21:21:23,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-12 21:21:23,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:23,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,540 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-12 21:21:23,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-12 21:21:23,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,575 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-12 21:21:23,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-12 21:21:23,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,601 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-12 21:21:23,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-12 21:21:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,627 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-12 21:21:23,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:23,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,655 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-12 21:21:23,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,686 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-12 21:21:23,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,722 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-12 21:21:23,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-12 21:21:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,760 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-12 21:21:23,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-12 21:21:23,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,793 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-12 21:21:23,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,818 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-12 21:21:23,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-12 21:21:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,861 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-12 21:21:23,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-12 21:21:23,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,887 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-12 21:21:23,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-12 21:21:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,915 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-12 21:21:23,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-12 21:21:23,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-12 21:21:23,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-12 21:21:23,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:23,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,945 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-12 21:21:23,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:23,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-12 21:21:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:23,978 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:23,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-12 21:21:23,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:23,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:23,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:23,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:23,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:23,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:23,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:23,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:24,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,014 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-12 21:21:24,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,051 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-12 21:21:24,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-12 21:21:24,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,092 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-12 21:21:24,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-12 21:21:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,129 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-12 21:21:24,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:24,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,159 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-12 21:21:24,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,172 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:24,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,191 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-12 21:21:24,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-12 21:21:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,217 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-12 21:21:24,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-12 21:21:24,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,249 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-12 21:21:24,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-12 21:21:24,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,280 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-12 21:21:24,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-12 21:21:24,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-12 21:21:24,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,308 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-12 21:21:24,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-12 21:21:24,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-12 21:21:24,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-12 21:21:24,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-12 21:21:24,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-12 21:21:24,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-12 21:21:24,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-12 21:21:24,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-12 21:21:24,348 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-12 21:21:24,348 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-12 21:21:24,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:21:24,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,351 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-12 21:21:24,353 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-12 21:21:24,365 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-12 21:21:24,365 INFO L474 LassoAnalysis]: Proved termination. [2024-11-12 21:21:24,366 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1) = -2*ULTIMATE.start_f_~i~1#1 + 3 Supporting invariants [] [2024-11-12 21:21:24,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-12 21:21:24,388 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-12 21:21:24,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:24,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:21:24,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:24,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 21:21:24,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 21:21:24,487 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-12 21:21:24,487 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-12 21:21:24,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Result 33 states and 41 transitions. Complement of second has 5 states. [2024-11-12 21:21:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-12 21:21:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-12 21:21:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2024-11-12 21:21:24,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-12 21:21:24,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:21:24,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-12 21:21:24,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:21:24,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2024-11-12 21:21:24,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-12 21:21:24,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2024-11-12 21:21:24,514 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:24,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 40 transitions. [2024-11-12 21:21:24,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-12 21:21:24,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-12 21:21:24,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2024-11-12 21:21:24,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:21:24,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-12 21:21:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2024-11-12 21:21:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-12 21:21:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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) [2024-11-12 21:21:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-12 21:21:24,520 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-12 21:21:24,520 INFO L426 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-12 21:21:24,520 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:21:24,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-11-12 21:21:24,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:24,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:24,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:24,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:24,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:24,522 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2024-11-12 21:21:24,522 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2024-11-12 21:21:24,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2024-11-12 21:21:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365107498] [2024-11-12 21:21:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365107498] [2024-11-12 21:21:24,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365107498] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:24,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627648565] [2024-11-12 21:21:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:24,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:24,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:24,579 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:24,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-12 21:21:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:24,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 21:21:24,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:24,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:24,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627648565] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:24,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:24,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-12 21:21:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115081819] [2024-11-12 21:21:24,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:24,691 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:21:24,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:24,692 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 1 times [2024-11-12 21:21:24,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:24,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279506455] [2024-11-12 21:21:24,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:24,696 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:24,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 21:21:24,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 21:21:24,751 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2024-11-12 21:21:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:24,773 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-12 21:21:24,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-11-12 21:21:24,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:24,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 43 transitions. [2024-11-12 21:21:24,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-12 21:21:24,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-12 21:21:24,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2024-11-12 21:21:24,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:21:24,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-12 21:21:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2024-11-12 21:21:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-12 21:21:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 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) [2024-11-12 21:21:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-12 21:21:24,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-12 21:21:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 21:21:24,778 INFO L426 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-12 21:21:24,778 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 21:21:24,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-11-12 21:21:24,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:24,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:24,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:24,779 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:24,779 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:24,779 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2024-11-12 21:21:24,779 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2024-11-12 21:21:24,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2024-11-12 21:21:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904367599] [2024-11-12 21:21:24,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:24,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-12 21:21:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904367599] [2024-11-12 21:21:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904367599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610783926] [2024-11-12 21:21:25,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:25,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:25,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:25,139 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:25,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-12 21:21:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:25,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 21:21:25,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:25,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 21:21:25,386 INFO L378 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 15 treesize of output 7 [2024-11-12 21:21:25,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:25,437 INFO L378 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 14 treesize of output 12 [2024-11-12 21:21:25,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2024-11-12 21:21:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610783926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:25,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-11-12 21:21:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776161195] [2024-11-12 21:21:25,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:25,538 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:21:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 2 times [2024-11-12 21:21:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141649906] [2024-11-12 21:21:25,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:25,543 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:25,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 21:21:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-12 21:21:25,595 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 12 Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 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) [2024-11-12 21:21:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:25,833 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-12 21:21:25,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2024-11-12 21:21:25,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2024-11-12 21:21:25,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 46 states and 56 transitions. [2024-11-12 21:21:25,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-12 21:21:25,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-12 21:21:25,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2024-11-12 21:21:25,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:21:25,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-12 21:21:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2024-11-12 21:21:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2024-11-12 21:21:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 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) [2024-11-12 21:21:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-12 21:21:25,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-12 21:21:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 21:21:25,839 INFO L426 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-12 21:21:25,840 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 21:21:25,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2024-11-12 21:21:25,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:25,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:25,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:25,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:25,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:25,841 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2024-11-12 21:21:25,841 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2024-11-12 21:21:25,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2024-11-12 21:21:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:25,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848183157] [2024-11-12 21:21:25,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:25,867 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:25,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:25,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash 100872, now seen corresponding path program 3 times [2024-11-12 21:21:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:25,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558420025] [2024-11-12 21:21:25,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:25,891 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:25,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:25,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 951949762, now seen corresponding path program 1 times [2024-11-12 21:21:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:25,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650572591] [2024-11-12 21:21:25,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650572591] [2024-11-12 21:21:27,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650572591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:27,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527689617] [2024-11-12 21:21:27,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:27,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:27,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:27,074 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:27,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-12 21:21:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:27,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 21:21:27,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:27,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:27,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:27,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:27,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-12 21:21:27,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:27,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-12 21:21:27,475 INFO L378 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 15 treesize of output 7 [2024-11-12 21:21:27,477 INFO L378 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 15 treesize of output 7 [2024-11-12 21:21:27,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:33,672 INFO L378 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 14 treesize of output 12 [2024-11-12 21:21:33,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2024-11-12 21:21:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527689617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:33,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 28 [2024-11-12 21:21:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916508856] [2024-11-12 21:21:33,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 21:21:33,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=637, Unknown=1, NotChecked=0, Total=756 [2024-11-12 21:21:33,753 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 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) [2024-11-12 21:21:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:34,163 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-12 21:21:34,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2024-11-12 21:21:34,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:34,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 49 transitions. [2024-11-12 21:21:34,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-12 21:21:34,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-12 21:21:34,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2024-11-12 21:21:34,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:21:34,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-12 21:21:34,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2024-11-12 21:21:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-12 21:21:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 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) [2024-11-12 21:21:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-12 21:21:34,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-12 21:21:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 21:21:34,168 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-12 21:21:34,168 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 21:21:34,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2024-11-12 21:21:34,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:34,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:34,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:34,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:34,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-12 21:21:34,170 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2024-11-12 21:21:34,170 INFO L749 eck$LassoCheckResult]: Loop: "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2024-11-12 21:21:34,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2024-11-12 21:21:34,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:34,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197625688] [2024-11-12 21:21:34,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:34,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:34,216 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:34,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 1 times [2024-11-12 21:21:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229580375] [2024-11-12 21:21:34,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:34,251 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:34,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash -289285846, now seen corresponding path program 1 times [2024-11-12 21:21:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090363512] [2024-11-12 21:21:34,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090363512] [2024-11-12 21:21:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090363512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674781866] [2024-11-12 21:21:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:34,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:34,780 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:34,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-12 21:21:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:34,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-12 21:21:34,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:35,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:35,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:35,162 INFO L378 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 17 treesize of output 15 [2024-11-12 21:21:35,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-12 21:21:35,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674781866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:35,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2024-11-12 21:21:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810949196] [2024-11-12 21:21:35,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:35,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 21:21:35,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-11-12 21:21:35,482 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 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) [2024-11-12 21:21:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:35,848 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-12 21:21:35,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2024-11-12 21:21:35,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:35,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 56 transitions. [2024-11-12 21:21:35,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-12 21:21:35,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-12 21:21:35,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2024-11-12 21:21:35,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-12 21:21:35,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-12 21:21:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2024-11-12 21:21:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-12 21:21:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 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) [2024-11-12 21:21:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-12 21:21:35,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-12 21:21:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 21:21:35,854 INFO L426 stractBuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-12 21:21:35,854 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 21:21:35,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2024-11-12 21:21:35,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:35,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:35,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:35,856 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:35,856 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-12 21:21:35,856 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !(f_~i~1#1 < 2);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2024-11-12 21:21:35,857 INFO L749 eck$LassoCheckResult]: Loop: "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" [2024-11-12 21:21:35,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2024-11-12 21:21:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409380963] [2024-11-12 21:21:35,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:21:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409380963] [2024-11-12 21:21:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409380963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:21:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625240288] [2024-11-12 21:21:36,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:21:36,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:21:36,483 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:21:36,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-11-12 21:21:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:21:36,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 21:21:36,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:21:36,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:36,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 21:21:36,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:36,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-12 21:21:36,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 21:21:36,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-11-12 21:21:36,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:21:36,933 INFO L378 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 16 treesize of output 14 [2024-11-12 21:21:36,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2024-11-12 21:21:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625240288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:21:36,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:21:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2024-11-12 21:21:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588203253] [2024-11-12 21:21:36,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:21:36,960 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-12 21:21:36,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash 102421811, now seen corresponding path program 2 times [2024-11-12 21:21:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:36,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597833997] [2024-11-12 21:21:36,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:36,968 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:36,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:21:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 21:21:37,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-11-12 21:21:37,127 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. cyclomatic complexity: 12 Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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) [2024-11-12 21:21:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:21:37,428 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-12 21:21:37,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 47 transitions. [2024-11-12 21:21:37,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:37,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 46 transitions. [2024-11-12 21:21:37,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-12 21:21:37,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-12 21:21:37,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 46 transitions. [2024-11-12 21:21:37,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:21:37,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-12 21:21:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 46 transitions. [2024-11-12 21:21:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 21:21:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 40 states have internal predecessors, (46), 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) [2024-11-12 21:21:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-12 21:21:37,432 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-12 21:21:37,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 21:21:37,435 INFO L426 stractBuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-12 21:21:37,435 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 21:21:37,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 46 transitions. [2024-11-12 21:21:37,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-12 21:21:37,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:21:37,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:21:37,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:21:37,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-12 21:21:37,438 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(8, 4);~#pp~0.base, ~#pp~0.offset := 4, 0;call write~init~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$#1(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call #Ultimate.allocInit(8, 5);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call write~init~int#2(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int#2(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !!(init_~i~0#1 < 2);call write~$Pointer$#1(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int#2(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4);" "init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1;" "assume !(init_~i~0#1 < 2);" "havoc init_#t~post4#1, init_~i~0#1;assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1;" "main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;havoc fake_malloc_#in~size#1;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;" "assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume !(f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0);havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;" "f_#t~post6#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post6#1;havoc f_#t~post6#1;" "assume !!(f_~i~1#1 < 2);call f_#t~mem5#1.base, f_#t~mem5#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);" "assume f_#t~mem5#1.base == 0 && f_#t~mem5#1.offset == 0;havoc f_#t~mem5#1.base, f_#t~mem5#1.offset;call write~$Pointer$#1(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int#2(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4);" "havoc f_#t~mem5#1.base, f_#t~mem5#1.offset, f_#t~post6#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;havoc f_#in~pointer#1.base, f_#in~pointer#1.offset;assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;call g_#t~mem8#1 := read~int#2(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "assume 1 == g_#t~mem8#1;" "havoc g_#t~mem8#1;call write~int#2(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4);" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" "assume !(g_~i~2#1 < 2);" "havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;havoc g_#in~pointer#1.base, g_#in~pointer#1.offset;assume { :end_inline_g } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc g_#t~mem7#1.base, g_#t~mem7#1.offset, g_#t~mem8#1, g_#t~post9#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0;" [2024-11-12 21:21:37,438 INFO L749 eck$LassoCheckResult]: Loop: "assume !!(g_~i~2#1 < 2);call g_#t~mem7#1.base, g_#t~mem7#1.offset := read~$Pointer$#1(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4);" "assume !(g_#t~mem7#1.base == g_~pointer#1.base && g_#t~mem7#1.offset == g_~pointer#1.offset);havoc g_#t~mem7#1.base, g_#t~mem7#1.offset;" "g_#t~post9#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post9#1;havoc g_#t~post9#1;" [2024-11-12 21:21:37,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1885261436, now seen corresponding path program 1 times [2024-11-12 21:21:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474875322] [2024-11-12 21:21:37,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:37,480 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:37,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:37,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:37,511 INFO L85 PathProgramCache]: Analyzing trace with hash 132648, now seen corresponding path program 1 times [2024-11-12 21:21:37,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:37,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303871170] [2024-11-12 21:21:37,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:37,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:37,516 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:37,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:21:37,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:21:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1463787059, now seen corresponding path program 1 times [2024-11-12 21:21:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:21:37,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949983286] [2024-11-12 21:21:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:21:37,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:21:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:37,559 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:21:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:21:37,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace