./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash a7eac656f4f87b6afedc7c9123b2a00f0a77432e0932a24df49c305c8202e110 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 23:54:06,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 23:54:06,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-24 23:54:06,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 23:54:06,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 23:54:06,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 23:54:06,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 23:54:06,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 23:54:06,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 23:54:06,308 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 23:54:06,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 23:54:06,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 23:54:06,309 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 23:54:06,309 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-24 23:54:06,310 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-24 23:54:06,310 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-24 23:54:06,310 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-24 23:54:06,310 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-24 23:54:06,311 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-24 23:54:06,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 23:54:06,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-24 23:54:06,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 23:54:06,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 23:54:06,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-24 23:54:06,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-24 23:54:06,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-24 23:54:06,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 23:54:06,314 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 23:54:06,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 23:54:06,315 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-24 23:54:06,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 23:54:06,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 23:54:06,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 23:54:06,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 23:54:06,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 23:54:06,317 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-24 23:54:06,317 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eac656f4f87b6afedc7c9123b2a00f0a77432e0932a24df49c305c8202e110 [2024-10-24 23:54:06,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 23:54:06,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 23:54:06,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 23:54:06,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 23:54:06,612 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 23:54:06,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2024-10-24 23:54:08,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 23:54:08,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 23:54:08,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2024-10-24 23:54:08,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1232221d/d3bd610852994790860cafa175071064/FLAG596019dd5 [2024-10-24 23:54:08,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1232221d/d3bd610852994790860cafa175071064 [2024-10-24 23:54:08,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 23:54:08,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 23:54:08,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 23:54:08,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 23:54:08,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 23:54:08,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:08" (1/1) ... [2024-10-24 23:54:08,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74eb9990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:08, skipping insertion in model container [2024-10-24 23:54:08,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:08" (1/1) ... [2024-10-24 23:54:08,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 23:54:08,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:54:08,967 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 23:54:09,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:54:09,034 INFO L204 MainTranslator]: Completed translation [2024-10-24 23:54:09,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09 WrapperNode [2024-10-24 23:54:09,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 23:54:09,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 23:54:09,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 23:54:09,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 23:54:09,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,091 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-24 23:54:09,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 23:54:09,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 23:54:09,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 23:54:09,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 23:54:09,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,123 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [8, 5, 2]. 53 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [3, 3, 1]. [2024-10-24 23:54:09,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 23:54:09,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 23:54:09,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 23:54:09,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 23:54:09,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (1/1) ... [2024-10-24 23:54:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:09,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:09,179 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-10-24 23:54:09,185 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-10-24 23:54:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 23:54:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 23:54:09,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 23:54:09,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 23:54:09,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 23:54:09,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 23:54:09,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 23:54:09,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 23:54:09,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 23:54:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 23:54:09,430 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 23:54:09,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 23:54:09,573 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 23:54:09,574 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 23:54:09,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 23:54:09,584 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 23:54:09,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:09 BoogieIcfgContainer [2024-10-24 23:54:09,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 23:54:09,588 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-24 23:54:09,589 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-24 23:54:09,592 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-24 23:54:09,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:54:09,593 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 24.10 11:54:08" (1/3) ... [2024-10-24 23:54:09,594 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c0f2884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:54:09, skipping insertion in model container [2024-10-24 23:54:09,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:54:09,594 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:09" (2/3) ... [2024-10-24 23:54:09,595 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c0f2884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:54:09, skipping insertion in model container [2024-10-24 23:54:09,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:54:09,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:09" (3/3) ... [2024-10-24 23:54:09,596 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.02-alloca.i [2024-10-24 23:54:09,660 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-24 23:54:09,660 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-24 23:54:09,660 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-24 23:54:09,661 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-24 23:54:09,661 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-24 23:54:09,661 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-24 23:54:09,661 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-24 23:54:09,661 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-24 23:54:09,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-10-24 23:54:09,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-24 23:54:09,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:09,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:09,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:54:09,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-24 23:54:09,680 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-24 23:54:09,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-10-24 23:54:09,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-24 23:54:09,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:09,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:09,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:54:09,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-24 23:54:09,688 INFO L745 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 7#L555-5true [2024-10-24 23:54:09,688 INFO L747 eck$LassoCheckResult]: Loop: 7#L555-5true call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 12#L555-1true assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3#L555-3true assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4#L558-3true assume !true; 13#L558-4true call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 7#L555-5true [2024-10-24 23:54:09,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-24 23:54:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000181914] [2024-10-24 23:54:09,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:09,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:09,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:09,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash 35409968, now seen corresponding path program 1 times [2024-10-24 23:54:09,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:09,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251440477] [2024-10-24 23:54:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:09,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251440477] [2024-10-24 23:54:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251440477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:54:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:54:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 23:54:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309547060] [2024-10-24 23:54:09,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:54:09,954 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-24 23:54:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 23:54:09,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 23:54:09,980 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-10-24 23:54:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:09,984 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2024-10-24 23:54:09,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2024-10-24 23:54:09,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-24 23:54:09,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2024-10-24 23:54:09,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-24 23:54:09,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-24 23:54:09,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2024-10-24 23:54:09,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-24 23:54:09,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-10-24 23:54:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2024-10-24 23:54:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-24 23:54:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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-10-24 23:54:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2024-10-24 23:54:10,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-10-24 23:54:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 23:54:10,016 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-10-24 23:54:10,017 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-24 23:54:10,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2024-10-24 23:54:10,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-24 23:54:10,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:10,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:10,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:54:10,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-24 23:54:10,019 INFO L745 eck$LassoCheckResult]: Stem: 37#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 40#L555-5 [2024-10-24 23:54:10,019 INFO L747 eck$LassoCheckResult]: Loop: 40#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 41#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 34#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 35#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 36#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 39#L558-4 call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 40#L555-5 [2024-10-24 23:54:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-24 23:54:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080114920] [2024-10-24 23:54:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1097702127, now seen corresponding path program 1 times [2024-10-24 23:54:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442018989] [2024-10-24 23:54:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:10,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash 177751345, now seen corresponding path program 1 times [2024-10-24 23:54:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202572869] [2024-10-24 23:54:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:10,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:11,091 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:11,093 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:11,093 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:11,093 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:11,093 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:54:11,093 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:11,093 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:11,093 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:11,093 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration2_Lasso [2024-10-24 23:54:11,093 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:11,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:11,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:11,905 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:11,909 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:54:11,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:11,913 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-10-24 23:54:11,915 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-10-24 23:54:11,917 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-10-24 23:54:11,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:11,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:11,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:11,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:11,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:11,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:11,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:11,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:11,961 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-10-24 23:54:11,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:11,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:11,964 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-10-24 23:54:11,965 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-10-24 23:54:11,967 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-10-24 23:54:11,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:11,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:11,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:11,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:11,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:11,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:11,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:11,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-24 23:54:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,002 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-10-24 23:54:12,003 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-10-24 23:54:12,004 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-10-24 23:54:12,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:12,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:12,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:12,020 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-24 23:54:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,036 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-10-24 23:54:12,037 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-10-24 23:54:12,039 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-10-24 23:54:12,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:12,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:12,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:12,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:12,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,073 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-10-24 23:54:12,074 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-10-24 23:54:12,076 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-10-24 23:54:12,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:12,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:12,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:12,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,106 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-10-24 23:54:12,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,108 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-10-24 23:54:12,110 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-10-24 23:54:12,112 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-10-24 23:54:12,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:12,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:12,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:12,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,142 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-10-24 23:54:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,144 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-10-24 23:54:12,146 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-10-24 23:54:12,146 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-10-24 23:54:12,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:12,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:12,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:12,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,171 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-10-24 23:54:12,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,172 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-10-24 23:54:12,174 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-10-24 23:54:12,174 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-10-24 23:54:12,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,206 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-10-24 23:54:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,209 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-10-24 23:54:12,211 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-10-24 23:54:12,212 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-10-24 23:54:12,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:12,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,250 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-10-24 23:54:12,252 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-10-24 23:54:12,253 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-10-24 23:54:12,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,285 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-10-24 23:54:12,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,288 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-24 23:54:12,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-24 23:54:12,290 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-10-24 23:54:12,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:12,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,340 INFO L229 MonitoredProcess]: Starting monitored process 13 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-10-24 23:54:12,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-24 23:54:12,341 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-10-24 23:54:12,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-24 23:54:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,375 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-10-24 23:54:12,377 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-10-24 23:54:12,379 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-10-24 23:54:12,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-24 23:54:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,414 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-10-24 23:54:12,415 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-10-24 23:54:12,416 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-10-24 23:54:12,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,455 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-10-24 23:54:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,457 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-10-24 23:54:12,459 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-10-24 23:54:12,460 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-10-24 23:54:12,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,513 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-10-24 23:54:12,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,515 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-10-24 23:54:12,517 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-10-24 23:54:12,518 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-10-24 23:54:12,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,554 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-10-24 23:54:12,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,557 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-10-24 23:54:12,558 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-10-24 23:54:12,559 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-10-24 23:54:12,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:12,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-24 23:54:12,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,596 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-10-24 23:54:12,597 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-10-24 23:54:12,599 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-10-24 23:54:12,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:12,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:12,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:12,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:12,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:12,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:12,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:54:12,657 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-24 23:54:12,657 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-24 23:54:12,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:12,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:12,679 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-10-24 23:54:12,682 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-10-24 23:54:12,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:54:12,701 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:54:12,701 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:54:12,702 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 + 1 Supporting invariants [] [2024-10-24 23:54:12,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-24 23:54:12,792 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-10-24 23:54:12,800 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-24 23:54:12,801 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-24 23:54:12,801 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-24 23:54:12,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:12,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:12,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:12,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 23:54:12,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:12,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2024-10-24 23:54:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:13,016 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-24 23:54:13,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-24 23:54:13,085 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 16 states and 21 transitions. Complement of second has 8 states. [2024-10-24 23:54:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-24 23:54:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-24 23:54:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-10-24 23:54:13,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-24 23:54:13,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2024-10-24 23:54:13,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 12 letters. [2024-10-24 23:54:13,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:13,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2024-10-24 23:54:13,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:13,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 20 transitions. [2024-10-24 23:54:13,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-24 23:54:13,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-24 23:54:13,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-24 23:54:13,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:13,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-24 23:54:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-24 23:54:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-10-24 23:54:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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-10-24 23:54:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-24 23:54:13,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:54:13,096 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:54:13,097 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-24 23:54:13,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-24 23:54:13,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:13,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:13,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:13,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-24 23:54:13,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-24 23:54:13,098 INFO L745 eck$LassoCheckResult]: Stem: 199#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 202#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 204#L555-1 assume !test_fun_#t~short7#1; 193#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 194#L558-3 [2024-10-24 23:54:13,099 INFO L747 eck$LassoCheckResult]: Loop: 194#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 197#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 194#L558-3 [2024-10-24 23:54:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2024-10-24 23:54:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:13,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018623268] [2024-10-24 23:54:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018623268] [2024-10-24 23:54:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018623268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:54:13,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:54:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 23:54:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143844004] [2024-10-24 23:54:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:54:13,153 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:54:13,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2024-10-24 23:54:13,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:13,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097576500] [2024-10-24 23:54:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 23:54:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 23:54:13,224 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-10-24 23:54:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:13,232 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2024-10-24 23:54:13,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2024-10-24 23:54:13,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:13,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 16 transitions. [2024-10-24 23:54:13,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-24 23:54:13,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-24 23:54:13,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-10-24 23:54:13,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:13,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-24 23:54:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-10-24 23:54:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-24 23:54:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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-10-24 23:54:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-24 23:54:13,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-24 23:54:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 23:54:13,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-24 23:54:13,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-24 23:54:13,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-10-24 23:54:13,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:13,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:13,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:13,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-24 23:54:13,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-24 23:54:13,239 INFO L745 eck$LassoCheckResult]: Stem: 233#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 236#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 238#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 227#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 228#L558-3 [2024-10-24 23:54:13,239 INFO L747 eck$LassoCheckResult]: Loop: 228#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 231#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 228#L558-3 [2024-10-24 23:54:13,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2024-10-24 23:54:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:13,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107601983] [2024-10-24 23:54:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:13,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2024-10-24 23:54:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838959251] [2024-10-24 23:54:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:13,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2024-10-24 23:54:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:13,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820186966] [2024-10-24 23:54:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:13,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:13,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:14,062 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:14,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:14,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:14,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:14,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:54:14,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:14,063 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:14,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration4_Lasso [2024-10-24 23:54:14,063 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:14,063 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:14,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,181 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-10-24 23:54:14,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:14,677 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:14,677 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:54:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,682 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-10-24 23:54:14,683 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-10-24 23:54:14,685 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-10-24 23:54:14,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:14,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,709 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-10-24 23:54:14,710 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-10-24 23:54:14,711 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-10-24 23:54:14,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,733 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-10-24 23:54:14,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,735 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-10-24 23:54:14,736 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-10-24 23:54:14,737 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-10-24 23:54:14,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-24 23:54:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,761 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-10-24 23:54:14,762 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-10-24 23:54:14,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-10-24 23:54:14,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:14,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:14,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,798 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-10-24 23:54:14,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,800 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-10-24 23:54:14,802 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-10-24 23:54:14,802 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-10-24 23:54:14,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:14,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,835 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-10-24 23:54:14,837 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-10-24 23:54:14,838 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-10-24 23:54:14,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,864 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-10-24 23:54:14,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,866 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-10-24 23:54:14,867 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-10-24 23:54:14,867 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-10-24 23:54:14,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,889 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-10-24 23:54:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,890 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-10-24 23:54:14,892 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-10-24 23:54:14,892 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-10-24 23:54:14,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,917 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-10-24 23:54:14,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,918 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-10-24 23:54:14,919 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-10-24 23:54:14,919 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-10-24 23:54:14,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:14,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:14,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,947 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-10-24 23:54:14,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,949 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-10-24 23:54:14,950 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-10-24 23:54:14,950 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-10-24 23:54:14,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-24 23:54:14,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,973 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-10-24 23:54:14,975 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-10-24 23:54:14,975 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-10-24 23:54:14,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:14,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:14,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:14,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:14,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:14,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:14,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:14,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:14,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:14,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:14,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:14,998 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-10-24 23:54:14,999 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-10-24 23:54:15,000 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-10-24 23:54:15,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,064 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-10-24 23:54:15,066 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-10-24 23:54:15,066 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-10-24 23:54:15,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:15,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:15,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:15,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,091 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-10-24 23:54:15,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,093 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-10-24 23:54:15,094 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-10-24 23:54:15,098 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-10-24 23:54:15,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,126 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-10-24 23:54:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,128 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-10-24 23:54:15,129 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-10-24 23:54:15,130 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-10-24 23:54:15,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,166 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-10-24 23:54:15,167 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-10-24 23:54:15,167 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-10-24 23:54:15,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,201 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-10-24 23:54:15,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,203 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-10-24 23:54:15,204 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-10-24 23:54:15,206 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-10-24 23:54:15,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,244 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-10-24 23:54:15,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,246 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-10-24 23:54:15,247 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-10-24 23:54:15,248 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-10-24 23:54:15,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,288 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-10-24 23:54:15,290 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-10-24 23:54:15,291 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-10-24 23:54:15,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,317 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-10-24 23:54:15,318 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-10-24 23:54:15,319 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-10-24 23:54:15,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,352 INFO L229 MonitoredProcess]: Starting monitored process 41 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-10-24 23:54:15,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-24 23:54:15,354 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-10-24 23:54:15,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:15,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,385 INFO L229 MonitoredProcess]: Starting monitored process 42 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-10-24 23:54:15,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-24 23:54:15,387 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-10-24 23:54:15,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:15,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:15,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:15,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:15,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:15,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:15,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:54:15,427 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-24 23:54:15,427 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-24 23:54:15,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:15,429 INFO L229 MonitoredProcess]: Starting monitored process 43 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-10-24 23:54:15,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-24 23:54:15,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:54:15,443 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:54:15,444 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:54:15,444 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 Supporting invariants [] [2024-10-24 23:54:15,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:15,494 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2024-10-24 23:54:15,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-24 23:54:15,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-24 23:54:15,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-24 23:54:15,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-24 23:54:15,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-24 23:54:15,497 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-10-24 23:54:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:15,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:15,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:15,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:54:15,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:15,580 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-10-24 23:54:15,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-24 23:54:15,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 36 states and 42 transitions. Complement of second has 7 states. [2024-10-24 23:54:15,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-24 23:54:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-24 23:54:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-10-24 23:54:15,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-24 23:54:15,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:15,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-24 23:54:15,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:15,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-24 23:54:15,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:15,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2024-10-24 23:54:15,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:15,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 28 transitions. [2024-10-24 23:54:15,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-24 23:54:15,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-24 23:54:15,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-10-24 23:54:15,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:15,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-24 23:54:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-10-24 23:54:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2024-10-24 23:54:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-10-24 23:54:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-10-24 23:54:15,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-24 23:54:15,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-10-24 23:54:15,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-24 23:54:15,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-10-24 23:54:15,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:15,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:15,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:15,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 23:54:15,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-24 23:54:15,616 INFO L745 eck$LassoCheckResult]: Stem: 390#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 394#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 395#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 401#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 393#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 400#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 399#L558-4 call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 396#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 398#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 384#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 385#L558-3 [2024-10-24 23:54:15,616 INFO L747 eck$LassoCheckResult]: Loop: 385#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 388#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 385#L558-3 [2024-10-24 23:54:15,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash -304350018, now seen corresponding path program 2 times [2024-10-24 23:54:15,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:15,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247273292] [2024-10-24 23:54:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:15,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:15,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-24 23:54:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247273292] [2024-10-24 23:54:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247273292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:54:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:54:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 23:54:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307707256] [2024-10-24 23:54:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:54:15,879 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:54:15,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2024-10-24 23:54:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464572896] [2024-10-24 23:54:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:15,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:15,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 23:54:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 23:54:15,955 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-10-24 23:54:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:16,021 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-24 23:54:16,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2024-10-24 23:54:16,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:16,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 27 transitions. [2024-10-24 23:54:16,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-24 23:54:16,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-24 23:54:16,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-10-24 23:54:16,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:16,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-10-24 23:54:16,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-10-24 23:54:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-24 23:54:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 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-10-24 23:54:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-24 23:54:16,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-24 23:54:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 23:54:16,026 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-24 23:54:16,026 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-24 23:54:16,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2024-10-24 23:54:16,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:16,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:16,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:16,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 23:54:16,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-24 23:54:16,027 INFO L745 eck$LassoCheckResult]: Stem: 455#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 458#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 459#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 469#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 468#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 467#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 466#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 464#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 463#L558-4 call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 460#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 462#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 449#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 450#L558-3 [2024-10-24 23:54:16,027 INFO L747 eck$LassoCheckResult]: Loop: 450#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 453#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 450#L558-3 [2024-10-24 23:54:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1112945891, now seen corresponding path program 1 times [2024-10-24 23:54:16,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:16,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935990450] [2024-10-24 23:54:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:16,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:16,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:16,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 4 times [2024-10-24 23:54:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:16,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045143959] [2024-10-24 23:54:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:16,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:16,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:16,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 94145288, now seen corresponding path program 2 times [2024-10-24 23:54:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040827139] [2024-10-24 23:54:16,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:16,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:54:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040827139] [2024-10-24 23:54:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040827139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 23:54:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670371680] [2024-10-24 23:54:16,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 23:54:16,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 23:54:16,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:16,565 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-10-24 23:54:16,567 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-10-24 23:54:16,655 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 23:54:16,655 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 23:54:16,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 23:54:16,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:16,663 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-10-24 23:54:16,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-24 23:54:16,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 23:54:16,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-24 23:54:16,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-24 23:54:16,777 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-10-24 23:54:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:16,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 23:54:16,867 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 19 treesize of output 11 [2024-10-24 23:54:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670371680] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 23:54:16,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 23:54:16,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-10-24 23:54:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531966311] [2024-10-24 23:54:16,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 23:54:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:54:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 23:54:16,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-24 23:54:16,949 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 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-10-24 23:54:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:54:17,055 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-10-24 23:54:17,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2024-10-24 23:54:17,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:17,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 30 states and 33 transitions. [2024-10-24 23:54:17,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-24 23:54:17,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-24 23:54:17,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2024-10-24 23:54:17,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:54:17,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-24 23:54:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2024-10-24 23:54:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-24 23:54:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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-10-24 23:54:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-24 23:54:17,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-24 23:54:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 23:54:17,059 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-24 23:54:17,059 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-24 23:54:17,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2024-10-24 23:54:17,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-24 23:54:17,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:54:17,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:54:17,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-24 23:54:17,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-24 23:54:17,060 INFO L745 eck$LassoCheckResult]: Stem: 630#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem8#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem11#1, test_fun_#t~mem12#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int#0(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#1(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#2(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 633#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 634#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 647#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 646#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 632#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 628#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 629#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 643#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 639#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 638#L558-4 call test_fun_#t~mem12#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 635#L555-5 call test_fun_#t~mem5#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 637#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 623#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int#0(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int#1(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 624#L558-3 [2024-10-24 23:54:17,060 INFO L747 eck$LassoCheckResult]: Loop: 624#L558-3 call test_fun_#t~mem9#1 := read~int#0(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 627#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int#1(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int#1(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 624#L558-3 [2024-10-24 23:54:17,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1629681608, now seen corresponding path program 3 times [2024-10-24 23:54:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258190367] [2024-10-24 23:54:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:17,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:17,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:17,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 5 times [2024-10-24 23:54:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:17,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404491249] [2024-10-24 23:54:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:17,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:17,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1539037011, now seen corresponding path program 4 times [2024-10-24 23:54:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:54:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896357694] [2024-10-24 23:54:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:54:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:54:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:17,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:54:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:54:17,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:54:19,589 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:54:19,589 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:54:19,589 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:54:19,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:54:19,589 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:54:19,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:19,589 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:54:19,589 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:54:19,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration7_Lasso [2024-10-24 23:54:19,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:54:19,589 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:54:19,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:19,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:54:20,134 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:54:20,134 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:54:20,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,137 INFO L229 MonitoredProcess]: Starting monitored process 45 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-10-24 23:54:20,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-24 23:54:20,140 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-10-24 23:54:20,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:20,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:20,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:20,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:20,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:20,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:20,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:20,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:20,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-24 23:54:20,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,165 INFO L229 MonitoredProcess]: Starting monitored process 46 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-10-24 23:54:20,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-24 23:54:20,166 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-10-24 23:54:20,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:20,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:20,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:20,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:20,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:20,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:20,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:20,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:20,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-24 23:54:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,190 INFO L229 MonitoredProcess]: Starting monitored process 47 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-10-24 23:54:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-24 23:54:20,193 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-10-24 23:54:20,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:20,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:20,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:20,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:20,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:20,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:20,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:20,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:20,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-24 23:54:20,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,217 INFO L229 MonitoredProcess]: Starting monitored process 48 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-10-24 23:54:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-24 23:54:20,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-10-24 23:54:20,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:20,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:20,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:20,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:20,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:20,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:20,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:20,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:20,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:20,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,252 INFO L229 MonitoredProcess]: Starting monitored process 49 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-10-24 23:54:20,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-24 23:54:20,255 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-10-24 23:54:20,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:20,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:54:20,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:20,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:20,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:20,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:54:20,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:54:20,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:54:20,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-24 23:54:20,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,278 INFO L229 MonitoredProcess]: Starting monitored process 50 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-10-24 23:54:20,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-24 23:54:20,280 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-10-24 23:54:20,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:54:20,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:54:20,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:54:20,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:54:20,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:54:20,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:54:20,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:54:20,317 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-24 23:54:20,317 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-24 23:54:20,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:54:20,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:54:20,320 INFO L229 MonitoredProcess]: Starting monitored process 51 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-10-24 23:54:20,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-24 23:54:20,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:54:20,332 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:54:20,332 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:54:20,332 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3, v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_3 Supporting invariants [] [2024-10-24 23:54:20,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-24 23:54:20,392 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-10-24 23:54:20,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-24 23:54:20,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-24 23:54:20,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-10-24 23:54:20,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-24 23:54:20,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-24 23:54:20,393 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-10-24 23:54:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:20,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:20,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:20,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:54:20,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:20,488 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-10-24 23:54:20,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 23:54:20,522 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 40 states and 45 transitions. Complement of second has 7 states. [2024-10-24 23:54:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-24 23:54:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 23:54:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-10-24 23:54:20,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-24 23:54:20,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:20,525 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-24 23:54:20,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:20,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:20,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:20,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-24 23:54:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:20,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:54:20,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:20,670 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:20,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 23:54:20,694 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 40 states and 45 transitions. Complement of second has 7 states. [2024-10-24 23:54:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-24 23:54:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 23:54:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-10-24 23:54:20,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-24 23:54:20,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:20,695 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-24 23:54:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:54:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:20,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:54:20,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:54:20,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:54:20,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:54:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:54:20,789 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-24 23:54:20,789 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 23:54:20,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 39 states and 45 transitions. Complement of second has 6 states. [2024-10-24 23:54:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-24 23:54:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 23:54:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-10-24 23:54:20,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-24 23:54:20,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:20,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2024-10-24 23:54:20,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-24 23:54:20,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:54:20,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-10-24 23:54:20,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:54:20,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2024-10-24 23:54:20,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-24 23:54:20,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-24 23:54:20,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-24 23:54:20,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-24 23:54:20,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:54:20,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:54:20,833 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:54:20,833 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-24 23:54:20,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-24 23:54:20,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:54:20,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-24 23:54:20,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 24.10 11:54:20 BoogieIcfgContainer [2024-10-24 23:54:20,843 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-24 23:54:20,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 23:54:20,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 23:54:20,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 23:54:20,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:09" (3/4) ... [2024-10-24 23:54:20,847 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 23:54:20,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 23:54:20,848 INFO L158 Benchmark]: Toolchain (without parser) took 12224.30ms. Allocated memory was 199.2MB in the beginning and 262.1MB in the end (delta: 62.9MB). Free memory was 141.0MB in the beginning and 201.1MB in the end (delta: -60.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-10-24 23:54:20,849 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 121.6MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:54:20,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.79ms. Allocated memory is still 199.2MB. Free memory was 141.0MB in the beginning and 123.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 23:54:20,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.80ms. Allocated memory is still 199.2MB. Free memory was 123.0MB in the beginning and 121.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 23:54:20,849 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 199.2MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 23:54:20,850 INFO L158 Benchmark]: RCFGBuilder took 443.97ms. Allocated memory is still 199.2MB. Free memory was 118.9MB in the beginning and 159.5MB in the end (delta: -40.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 23:54:20,850 INFO L158 Benchmark]: BuchiAutomizer took 11255.22ms. Allocated memory was 199.2MB in the beginning and 262.1MB in the end (delta: 62.9MB). Free memory was 158.5MB in the beginning and 201.1MB in the end (delta: -42.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-10-24 23:54:20,850 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 262.1MB. Free memory is still 201.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:54:20,851 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 121.6MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.79ms. Allocated memory is still 199.2MB. Free memory was 141.0MB in the beginning and 123.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.80ms. Allocated memory is still 199.2MB. Free memory was 123.0MB in the beginning and 121.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 199.2MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.97ms. Allocated memory is still 199.2MB. Free memory was 118.9MB in the beginning and 159.5MB in the end (delta: -40.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 11255.22ms. Allocated memory was 199.2MB in the beginning and 262.1MB in the end (delta: 62.9MB). Free memory was 158.5MB in the beginning and 201.1MB in the end (delta: -42.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 262.1MB. Free memory is still 201.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 10.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 63 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax108 hnf100 lsp91 ukn69 mio100 lsp25 div100 bol100 ite100 ukn100 eq161 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-24 23:54:20,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2024-10-24 23:54:21,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE