./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:19:42,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:19:42,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:19:42,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:19:42,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:19:42,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:19:42,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:19:42,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:19:42,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:19:42,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:19:42,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:19:42,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:19:42,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:19:42,175 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:19:42,177 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:19:42,177 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:19:42,178 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:19:42,178 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:19:42,178 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:19:42,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:19:42,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:19:42,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:19:42,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:19:42,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:19:42,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:19:42,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:19:42,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:19:42,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:19:42,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:19:42,185 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:19:42,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:19:42,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:19:42,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:19:42,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:19:42,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:19:42,187 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:19:42,189 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-11-19 14:19:42,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:19:42,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:19:42,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:19:42,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:19:42,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:19:42,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2024-11-19 14:19:43,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:19:44,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:19:44,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2024-11-19 14:19:44,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2368f69aa/874eab37abbb4d65814048b5d319a9f9/FLAG6472ea574 [2024-11-19 14:19:44,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2368f69aa/874eab37abbb4d65814048b5d319a9f9 [2024-11-19 14:19:44,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:19:44,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:19:44,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:19:44,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:19:44,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:19:44,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ab660f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44, skipping insertion in model container [2024-11-19 14:19:44,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:19:44,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:19:44,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:19:44,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:19:44,710 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:19:44,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44 WrapperNode [2024-11-19 14:19:44,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:19:44,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:19:44,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:19:44,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:19:44,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,745 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-19 14:19:44,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:19:44,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:19:44,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:19:44,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:19:44,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,767 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-11-19 14:19:44,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:19:44,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:19:44,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:19:44,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:19:44,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (1/1) ... [2024-11-19 14:19:44,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:44,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:44,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:19:44,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:19:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:19:44,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:19:44,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:19:44,957 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:19:44,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:19:45,068 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 14:19:45,069 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:19:45,084 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:19:45,084 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 14:19:45,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:45 BoogieIcfgContainer [2024-11-19 14:19:45,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:19:45,086 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:19:45,087 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:19:45,092 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:19:45,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:45,092 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:19:44" (1/3) ... [2024-11-19 14:19:45,093 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@598fa669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:19:45, skipping insertion in model container [2024-11-19 14:19:45,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:45,094 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:19:44" (2/3) ... [2024-11-19 14:19:45,095 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@598fa669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:19:45, skipping insertion in model container [2024-11-19 14:19:45,095 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:19:45,095 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:45" (3/3) ... [2024-11-19 14:19:45,096 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.02-alloca.i [2024-11-19 14:19:45,138 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:19:45,138 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:19:45,138 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:19:45,138 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:19:45,138 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:19:45,139 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:19:45,139 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:19:45,139 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:19:45,142 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-11-19 14:19:45,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:19:45,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:45,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:45,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:45,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:45,161 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:19:45,161 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-11-19 14:19:45,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:19:45,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:45,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:45,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:45,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:45,170 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-11-19 14:19:45,171 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-11-19 14:19:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:19:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357320161] [2024-11-19 14:19:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 35409968, now seen corresponding path program 1 times [2024-11-19 14:19:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:45,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561043075] [2024-11-19 14:19:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561043075] [2024-11-19 14:19:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561043075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:19:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538957574] [2024-11-19 14:19:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:45,499 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:19:45,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:45,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 14:19:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 14:19:45,534 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-11-19 14:19:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:45,540 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2024-11-19 14:19:45,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2024-11-19 14:19:45,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:19:45,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2024-11-19 14:19:45,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-19 14:19:45,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:19:45,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2024-11-19 14:19:45,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:45,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-19 14:19:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2024-11-19 14:19:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-19 14:19:45,593 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-11-19 14:19:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2024-11-19 14:19:45,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-19 14:19:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 14:19:45,600 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-19 14:19:45,601 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:19:45,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2024-11-19 14:19:45,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-19 14:19:45,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:45,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:45,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:19:45,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:19:45,603 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-11-19 14:19:45,604 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-11-19 14:19:45,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:19:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:45,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118067709] [2024-11-19 14:19:45,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:45,727 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:45,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:45,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:45,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:45,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1097702127, now seen corresponding path program 1 times [2024-11-19 14:19:45,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:45,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115506363] [2024-11-19 14:19:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:45,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash 177751345, now seen corresponding path program 1 times [2024-11-19 14:19:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795022122] [2024-11-19 14:19:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:45,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:46,762 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:46,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:46,763 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:46,763 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:46,763 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:46,763 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:46,763 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:46,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:46,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration2_Lasso [2024-11-19 14:19:46,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:46,765 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:46,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:46,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:47,681 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:47,684 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:19:47,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:19:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:19:47,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,768 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-11-19 14:19:47,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:19:47,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:47,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:19:47,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 14:19:47,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:19:47,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:19:47,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:19:47,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:19:47,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:19:47,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:47,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:47,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:47,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:47,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,944 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:19:47,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:47,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:47,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:47,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:47,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:47,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:47,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:47,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:47,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:19:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:47,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:47,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:47,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:19:47,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-19 14:19:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,027 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:19:48,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-19 14:19:48,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,064 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-11-19 14:19:48,065 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-11-19 14:19:48,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-11-19 14:19:48,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,106 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-11-19 14:19:48,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,108 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-11-19 14:19:48,108 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-11-19 14:19:48,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:48,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,143 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:19:48,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-11-19 14:19:48,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,180 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-11-19 14:19:48,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,182 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:19:48,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:48,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,220 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:19:48,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,263 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:19:48,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:48,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,304 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:19:48,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:48,341 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-11-19 14:19:48,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,344 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:19:48,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:48,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:48,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:48,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:48,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:48,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:48,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:48,370 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:48,400 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:19:48,400 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-19 14:19:48,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:48,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:48,423 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:48,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:19:48,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:48,438 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:48,438 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:48,439 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-11-19 14:19:48,449 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-11-19 14:19:48,508 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-11-19 14:19:48,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:48,518 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:48,519 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 14:19:48,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:48,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:48,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:48,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:19:48,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:48,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 14:19:48,741 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-11-19 14:19:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:48,777 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-11-19 14:19:48,778 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-11-19 14:19:48,850 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-11-19 14:19:48,852 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-11-19 14:19:48,853 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-11-19 14:19:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-11-19 14:19:48,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-19 14:19:48,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 8 letters. Loop has 6 letters. [2024-11-19 14:19:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:48,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 12 letters. [2024-11-19 14:19:48,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:48,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2024-11-19 14:19:48,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:48,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 20 transitions. [2024-11-19 14:19:48,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:19:48,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-19 14:19:48,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-11-19 14:19:48,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:48,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-11-19 14:19:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-11-19 14:19:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-11-19 14:19:48,859 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-11-19 14:19:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-19 14:19:48,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-19 14:19:48,859 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-19 14:19:48,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:19:48,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-19 14:19:48,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:48,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:48,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:48,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:48,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:48,861 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-11-19 14:19:48,861 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-11-19 14:19:48,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2024-11-19 14:19:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829732951] [2024-11-19 14:19:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:48,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829732951] [2024-11-19 14:19:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829732951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:48,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:48,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:19:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363974481] [2024-11-19 14:19:48,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:48,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2024-11-19 14:19:48,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091447999] [2024-11-19 14:19:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:48,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:48,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:19:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:19:49,010 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-11-19 14:19:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:49,021 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2024-11-19 14:19:49,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2024-11-19 14:19:49,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:49,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 16 transitions. [2024-11-19 14:19:49,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-11-19 14:19:49,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-11-19 14:19:49,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-11-19 14:19:49,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:49,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:19:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-11-19 14:19:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-19 14:19:49,024 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-11-19 14:19:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-11-19 14:19:49,024 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:19:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:19:49,026 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-11-19 14:19:49,026 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:19:49,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2024-11-19 14:19:49,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:49,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:49,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:49,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-19 14:19:49,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:49,028 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-11-19 14:19:49,028 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-11-19 14:19:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2024-11-19 14:19:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503558349] [2024-11-19 14:19:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:49,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:49,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2024-11-19 14:19:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456399486] [2024-11-19 14:19:49,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:49,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:49,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:49,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:49,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:49,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2024-11-19 14:19:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:49,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008852520] [2024-11-19 14:19:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:49,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:49,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:49,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:49,893 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:49,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:49,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:49,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:49,893 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:49,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:49,893 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:49,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:49,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration4_Lasso [2024-11-19 14:19:49,894 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:49,894 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:49,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:49,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:50,514 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:50,514 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:50,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,516 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:19:50,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-11-19 14:19:50,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-19 14:19:50,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,553 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:19:50,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,589 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:19:50,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,613 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-11-19 14:19:50,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,615 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:19:50,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-19 14:19:50,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,651 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:19:50,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 14:19:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,686 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:19:50,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:50,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,724 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:19:50,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,751 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:19:50,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:50,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,776 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:19:50,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:19:50,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,808 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:19:50,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,841 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-11-19 14:19:50,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,843 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:19:50,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,872 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-11-19 14:19:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,874 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:19:50,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:19:50,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,905 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:19:50,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:50,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:50,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:50,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-19 14:19:50,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,931 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:19:50,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:50,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:50,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-19 14:19:50,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:50,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:50,966 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:50,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:19:50,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-11-19 14:19:50,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:50,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:50,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:50,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:50,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:50,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:50,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,001 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-11-19 14:19:51,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,003 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:51,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:19:51,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:51,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:51,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,033 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:51,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:19:51,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:51,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:51,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,070 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:51,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:19:51,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:51,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 14:19:51,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,105 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:51,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:19:51,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:51,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,135 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-11-19 14:19:51,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,136 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:19:51,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:19:51,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:51,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,165 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-11-19 14:19:51,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,166 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-11-19 14:19:51,167 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-11-19 14:19:51,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-11-19 14:19:51,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:51,193 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-11-19 14:19:51,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,195 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-11-19 14:19:51,196 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-11-19 14:19:51,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:51,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:51,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:51,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:51,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:51,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:51,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:51,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:51,235 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-19 14:19:51,235 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-19 14:19:51,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:51,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:51,238 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-11-19 14:19:51,239 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-11-19 14:19:51,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:51,250 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:51,250 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:51,250 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-11-19 14:19:51,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-19 14:19:51,297 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2024-11-19 14:19:51,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:51,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:51,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 14:19:51,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:51,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:51,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-19 14:19:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:51,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:51,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:51,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:51,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:51,402 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-11-19 14:19:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:51,412 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:19:51,412 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-11-19 14:19:51,446 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-11-19 14:19:51,447 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-11-19 14:19:51,447 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-11-19 14:19:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-19 14:19:51,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-19 14:19:51,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:51,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-19 14:19:51,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:51,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-19 14:19:51,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:51,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2024-11-19 14:19:51,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:51,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 28 transitions. [2024-11-19 14:19:51,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-19 14:19:51,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-19 14:19:51,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-11-19 14:19:51,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:51,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 14:19:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-11-19 14:19:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2024-11-19 14:19:51,453 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-11-19 14:19:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-19 14:19:51,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-19 14:19:51,454 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-19 14:19:51,454 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:19:51,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-19 14:19:51,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:51,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:51,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:51,457 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:19:51,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:51,457 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-11-19 14:19:51,457 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-11-19 14:19:51,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash -304350018, now seen corresponding path program 2 times [2024-11-19 14:19:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328952945] [2024-11-19 14:19:51,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:51,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:51,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328952945] [2024-11-19 14:19:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328952945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:19:51,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:19:51,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 14:19:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066718875] [2024-11-19 14:19:51,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:19:51,749 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:19:51,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2024-11-19 14:19:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457667415] [2024-11-19 14:19:51,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,757 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:19:51,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:51,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:51,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:51,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:19:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:19:51,824 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-11-19 14:19:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:51,898 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-19 14:19:51,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2024-11-19 14:19:51,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:51,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 27 transitions. [2024-11-19 14:19:51,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-19 14:19:51,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-19 14:19:51,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2024-11-19 14:19:51,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:51,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-19 14:19:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2024-11-19 14:19:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-11-19 14:19:51,904 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-11-19 14:19:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-19 14:19:51,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 14:19:51,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:19:51,906 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-19 14:19:51,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:19:51,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2024-11-19 14:19:51,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:51,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:51,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:51,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:19:51,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:51,908 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-11-19 14:19:51,908 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-11-19 14:19:51,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1112945891, now seen corresponding path program 1 times [2024-11-19 14:19:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44492689] [2024-11-19 14:19:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:19:51,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:51,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 4 times [2024-11-19 14:19:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966595048] [2024-11-19 14:19:51,956 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:19:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,960 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:19:51,960 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:51,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:51,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 94145288, now seen corresponding path program 2 times [2024-11-19 14:19:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307874036] [2024-11-19 14:19:51,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:51,980 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:51,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:19:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307874036] [2024-11-19 14:19:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307874036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:19:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196191617] [2024-11-19 14:19:52,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:19:52,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:19:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:52,366 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:19:52,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-19 14:19:52,460 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:19:52,460 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:19:52,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 14:19:52,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:52,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 14:19:52,478 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-11-19 14:19:52,541 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-11-19 14:19:52,580 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-11-19 14:19:52,584 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-11-19 14:19:52,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 14:19:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:52,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:19:52,684 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-11-19 14:19:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196191617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:19:52,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:19:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-19 14:19:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555834648] [2024-11-19 14:19:52,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:19:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:19:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 14:19:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-11-19 14:19:52,760 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-11-19 14:19:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:19:52,849 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-19 14:19:52,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2024-11-19 14:19:52,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:52,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 30 states and 33 transitions. [2024-11-19 14:19:52,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-19 14:19:52,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-19 14:19:52,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2024-11-19 14:19:52,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:19:52,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-19 14:19:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2024-11-19 14:19:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-19 14:19:52,858 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-11-19 14:19:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-19 14:19:52,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-19 14:19:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:19:52,859 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-19 14:19:52,859 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:19:52,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2024-11-19 14:19:52,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-19 14:19:52,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:19:52,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:19:52,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-19 14:19:52,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:19:52,860 INFO L745 eck$LassoCheckResult]: Stem: 628#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 629#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); 631#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; 632#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; 645#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); 644#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); 630#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; 626#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; 641#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); 637#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; 636#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; 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; 635#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; 621#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); 622#L558-3 [2024-11-19 14:19:52,862 INFO L747 eck$LassoCheckResult]: Loop: 622#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); 625#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; 622#L558-3 [2024-11-19 14:19:52,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1629681608, now seen corresponding path program 3 times [2024-11-19 14:19:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800464129] [2024-11-19 14:19:52,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:19:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:52,898 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:19:52,899 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:52,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:52,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 5 times [2024-11-19 14:19:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094842424] [2024-11-19 14:19:52,915 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:19:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:52,920 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:19:52,920 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:52,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1539037011, now seen corresponding path program 4 times [2024-11-19 14:19:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:19:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727666793] [2024-11-19 14:19:52,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:19:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:19:52,949 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:19:52,949 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:19:52,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:19:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:19:52,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:19:55,487 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:19:55,487 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:19:55,487 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:19:55,487 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:19:55,487 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:19:55,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:55,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:19:55,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:19:55,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration7_Lasso [2024-11-19 14:19:55,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:19:55,488 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:19:55,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:55,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:19:56,042 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:19:56,042 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:19:56,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,044 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-11-19 14:19:56,045 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-11-19 14:19:56,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,068 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-11-19 14:19:56,069 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-11-19 14:19:56,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,092 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-11-19 14:19:56,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,094 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-11-19 14:19:56,094 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-11-19 14:19:56,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,116 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-11-19 14:19:56,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,117 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-11-19 14:19:56,118 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-11-19 14:19:56,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-19 14:19:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,142 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-11-19 14:19:56,142 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-11-19 14:19:56,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:19:56,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:19:56,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:19:56,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:19:56,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:19:56,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-19 14:19:56,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,165 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-11-19 14:19:56,166 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-11-19 14:19:56,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-11-19 14:19:56,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:19:56,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:19:56,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:19:56,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:19:56,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:19:56,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:19:56,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:19:56,208 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-19 14:19:56,208 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-19 14:19:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:19:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:19:56,210 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-11-19 14:19:56,211 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-11-19 14:19:56,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:19:56,225 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:19:56,225 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:19:56,225 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-11-19 14:19:56,235 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-11-19 14:19:56,279 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-11-19 14:19:56,280 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-19 14:19:56,280 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-19 14:19:56,281 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x_ref~0!base,]]] [2024-11-19 14:19:56,281 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:19:56,281 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:19:56,281 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2024-11-19 14:19:56,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:56,368 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:19:56,368 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-11-19 14:19:56,396 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-11-19 14:19:56,396 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-11-19 14:19:56,397 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-11-19 14:19:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-19 14:19:56,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-19 14:19:56,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,397 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:56,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:56,490 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-11-19 14:19:56,490 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-11-19 14:19:56,512 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-11-19 14:19:56,513 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-11-19 14:19:56,513 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-11-19 14:19:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2024-11-19 14:19:56,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-19 14:19:56,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,514 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:19:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:19:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:19:56,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:19:56,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:19:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:19:56,606 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-11-19 14:19:56,606 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-11-19 14:19:56,634 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-11-19 14:19:56,635 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-11-19 14:19:56,636 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-11-19 14:19:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2024-11-19 14:19:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2024-11-19 14:19:56,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2024-11-19 14:19:56,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2024-11-19 14:19:56,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:19:56,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-11-19 14:19:56,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:56,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2024-11-19 14:19:56,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:19:56,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:19:56,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:19:56,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:19:56,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:56,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:56,638 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:19:56,638 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:19:56,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:19:56,639 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:19:56,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:19:56,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:19:56 BoogieIcfgContainer [2024-11-19 14:19:56,647 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:19:56,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:19:56,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:19:56,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:19:56,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:19:45" (3/4) ... [2024-11-19 14:19:56,650 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:19:56,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:19:56,652 INFO L158 Benchmark]: Toolchain (without parser) took 12403.76ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 84.1MB in the beginning and 133.4MB in the end (delta: -49.3MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-11-19 14:19:56,652 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 110.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:56,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.88ms. Allocated memory is still 157.3MB. Free memory was 84.0MB in the beginning and 122.9MB in the end (delta: -38.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-11-19 14:19:56,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.85ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:56,653 INFO L158 Benchmark]: Boogie Preprocessor took 34.40ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:19:56,653 INFO L158 Benchmark]: RCFGBuilder took 300.69ms. Allocated memory is still 157.3MB. Free memory was 118.7MB in the beginning and 105.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 14:19:56,654 INFO L158 Benchmark]: BuchiAutomizer took 11561.07ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 105.0MB in the beginning and 133.4MB in the end (delta: -28.4MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-11-19 14:19:56,654 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 249.6MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:19:56,655 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.67ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 110.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.88ms. Allocated memory is still 157.3MB. Free memory was 84.0MB in the beginning and 122.9MB in the end (delta: -38.9MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.85ms. Allocated memory is still 157.3MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.40ms. Allocated memory is still 157.3MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.69ms. Allocated memory is still 157.3MB. Free memory was 118.7MB in the beginning and 105.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 11561.07ms. Allocated memory was 157.3MB in the beginning and 249.6MB in the end (delta: 92.3MB). Free memory was 105.0MB in the beginning and 133.4MB in the end (delta: -28.4MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 249.6MB. Free memory is still 133.4MB. 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.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 10.3s. 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, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 63 mSDtfsCounter, 210 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: 23ms 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-11-19 14:19:56,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:56,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2024-11-19 14:19:57,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE