./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.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 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:01:03,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:01:03,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:01:03,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:01:03,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:01:03,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:01:03,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:01:03,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:01:03,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:01:03,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:01:03,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:01:03,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:01:03,135 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:01:03,136 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:01:03,136 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:01:03,137 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:01:03,137 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:01:03,137 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:01:03,138 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:01:03,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:01:03,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:01:03,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:01:03,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:01:03,141 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:01:03,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:01:03,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:01:03,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:01:03,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:01:03,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:01:03,142 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:01:03,143 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 -> 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 [2024-10-13 17:01:03,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:01:03,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:01:03,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:01:03,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:01:03,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:01:03,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2024-10-13 17:01:04,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:01:05,065 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:01:05,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2024-10-13 17:01:05,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcd7360b/265fed01a1de4ea5b166307eed22aa25/FLAGefb740e2e [2024-10-13 17:01:05,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcd7360b/265fed01a1de4ea5b166307eed22aa25 [2024-10-13 17:01:05,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:01:05,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:01:05,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:05,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:01:05,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:01:05,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641e2755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05, skipping insertion in model container [2024-10-13 17:01:05,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:01:05,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:05,697 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:01:05,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:05,753 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:01:05,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05 WrapperNode [2024-10-13 17:01:05,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:05,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:05,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:01:05,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:01:05,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,787 INFO L138 Inliner]: procedures = 110, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2024-10-13 17:01:05,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:05,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:01:05,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:01:05,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:01:05,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,815 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [8, 7]. 53 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 8 writes are split as follows [4, 4]. [2024-10-13 17:01:05,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:01:05,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:01:05,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:01:05,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:01:05,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (1/1) ... [2024-10-13 17:01:05,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:05,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:05,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:05,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:01:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:01:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 17:01:05,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:01:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 17:01:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:01:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:01:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:01:05,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:01:05,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:01:05,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:01:06,111 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-13 17:01:06,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:01:06,127 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:01:06,130 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 17:01:06,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:06 BoogieIcfgContainer [2024-10-13 17:01:06,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:01:06,131 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:01:06,131 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:01:06,136 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:01:06,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:06,137 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:01:05" (1/3) ... [2024-10-13 17:01:06,138 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14ea8722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:06, skipping insertion in model container [2024-10-13 17:01:06,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:06,139 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:05" (2/3) ... [2024-10-13 17:01:06,139 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14ea8722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:06, skipping insertion in model container [2024-10-13 17:01:06,139 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:06,140 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:06" (3/3) ... [2024-10-13 17:01:06,141 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-alloca-2.i [2024-10-13 17:01:06,187 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:01:06,187 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:01:06,188 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:01:06,188 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:01:06,188 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:01:06,188 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:01:06,189 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:01:06,189 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:01:06,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:06,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:06,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:06,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:06,209 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:06,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:06,210 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:01:06,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:06,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-10-13 17:01:06,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:06,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:06,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:06,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:06,219 INFO L745 eck$LassoCheckResult]: Stem: 8#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 9#L561-2true [2024-10-13 17:01:06,219 INFO L747 eck$LassoCheckResult]: Loop: 9#L561-2true call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 11#L552-1true assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 4#L552-3true assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 3#L553true assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 6#L561true assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 9#L561-2true [2024-10-13 17:01:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:01:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004639918] [2024-10-13 17:01:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 35409937, now seen corresponding path program 1 times [2024-10-13 17:01:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199368504] [2024-10-13 17:01:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849423, now seen corresponding path program 1 times [2024-10-13 17:01:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011989726] [2024-10-13 17:01:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,965 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:06,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:06,966 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:06,966 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:06,966 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:06,966 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:06,966 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:06,966 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:06,966 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration1_Lasso [2024-10-13 17:01:06,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:06,967 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:06,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:06,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:06,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:06,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:06,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:06,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:07,502 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:07,505 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:07,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:01:07,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:01:07,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:01:07,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 17:01:07,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:01:07,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,631 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-10-13 17:01:07,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:01:07,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,663 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-10-13 17:01:07,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 17:01:07,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 17:01:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,695 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 17:01:07,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 17:01:07,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:07,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 17:01:07,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-10-13 17:01:07,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 17:01:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,780 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 17:01:07,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:07,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:07,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:07,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,811 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-10-13 17:01:07,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 17:01:07,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-10-13 17:01:07,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:07,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 17:01:07,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-13 17:01:07,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,905 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 17:01:07,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-10-13 17:01:07,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-13 17:01:07,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,937 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 17:01:07,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:07,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:07,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 17:01:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:07,978 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:07,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 17:01:07,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:07,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:07,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:07,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:07,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:07,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:07,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:08,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:08,010 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-13 17:01:08,011 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 17:01:08,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:08,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:08,034 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:08,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:01:08,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:08,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:01:08,048 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:08,048 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) 0)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) 0)_1 Supporting invariants [] [2024-10-13 17:01:08,061 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-10-13 17:01:08,090 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-13 17:01:08,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:01:08,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:01:08,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-13 17:01:08,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:08,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:08,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:08,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 17:01:08,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:08,278 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-10-13 17:01:08,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:08,421 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 48 states and 71 transitions. Complement of second has 16 states. [2024-10-13 17:01:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-10-13 17:01:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 2 letters. Loop has 5 letters. [2024-10-13 17:01:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:08,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 7 letters. Loop has 5 letters. [2024-10-13 17:01:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:08,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 2 letters. Loop has 10 letters. [2024-10-13 17:01:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:08,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 71 transitions. [2024-10-13 17:01:08,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 17:01:08,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 26 states and 37 transitions. [2024-10-13 17:01:08,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-13 17:01:08,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-13 17:01:08,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2024-10-13 17:01:08,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:08,434 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 37 transitions. [2024-10-13 17:01:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2024-10-13 17:01:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-13 17:01:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2024-10-13 17:01:08,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-13 17:01:08,452 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2024-10-13 17:01:08,452 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:01:08,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2024-10-13 17:01:08,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 17:01:08,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:08,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:08,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:01:08,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,453 INFO L745 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 190#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 189#L552-1 assume !main_#t~short8#1; 191#L552-3 [2024-10-13 17:01:08,453 INFO L747 eck$LassoCheckResult]: Loop: 191#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 194#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 195#L554 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1; 186#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 187#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 191#L552-3 [2024-10-13 17:01:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-10-13 17:01:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059714339] [2024-10-13 17:01:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 45903353, now seen corresponding path program 1 times [2024-10-13 17:01:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915262780] [2024-10-13 17:01:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1272522354, now seen corresponding path program 1 times [2024-10-13 17:01:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506638162] [2024-10-13 17:01:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506638162] [2024-10-13 17:01:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506638162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 17:01:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648669158] [2024-10-13 17:01:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:08,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:01:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:01:08,688 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:08,697 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-10-13 17:01:08,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-10-13 17:01:08,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 17:01:08,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 32 transitions. [2024-10-13 17:01:08,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-13 17:01:08,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-13 17:01:08,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2024-10-13 17:01:08,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:08,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-10-13 17:01:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2024-10-13 17:01:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-13 17:01:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-10-13 17:01:08,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-13 17:01:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:01:08,702 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-13 17:01:08,702 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:01:08,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2024-10-13 17:01:08,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 17:01:08,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:08,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:08,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-13 17:01:08,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:08,704 INFO L745 eck$LassoCheckResult]: Stem: 243#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 249#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 246#L552-1 [2024-10-13 17:01:08,704 INFO L747 eck$LassoCheckResult]: Loop: 246#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 253#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 251#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 252#L554 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1; 245#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 246#L552-1 [2024-10-13 17:01:08,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-10-13 17:01:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968199356] [2024-10-13 17:01:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 2 times [2024-10-13 17:01:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320527527] [2024-10-13 17:01:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 177749398, now seen corresponding path program 1 times [2024-10-13 17:01:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:08,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864480121] [2024-10-13 17:01:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:08,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:08,886 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-10-13 17:01:09,160 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:09,161 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:09,161 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:09,161 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:09,161 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:09,161 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:09,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:09,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration3_Lasso [2024-10-13 17:01:09,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:09,161 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:09,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,574 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:09,575 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:09,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 17:01:09,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:09,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-13 17:01:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,602 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:09,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 17:01:09,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:09,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:09,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,628 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:09,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 17:01:09,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:09,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:09,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:09,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 17:01:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,677 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:09,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 17:01:09,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:09,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,714 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-10-13 17:01:09,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,716 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:09,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 17:01:09,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:09,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:09,737 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-13 17:01:09,738 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:01:09,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,739 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:09,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 17:01:09,741 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:09,741 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:01:09,741 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:09,741 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2 Supporting invariants [] [2024-10-13 17:01:09,752 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-10-13 17:01:09,767 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-10-13 17:01:09,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-13 17:01:09,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-13 17:01:09,768 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-10-13 17:01:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:09,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:09,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:09,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:09,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:09,874 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 32 treesize of output 16 [2024-10-13 17:01:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:09,892 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-10-13 17:01:09,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:09,931 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 30 transitions. cyclomatic complexity: 11. 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 61 states and 77 transitions. Complement of second has 9 states. [2024-10-13 17:01:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-13 17:01:09,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 5 letters. [2024-10-13 17:01:09,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:09,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:09,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:09,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 3 letters. Loop has 10 letters. [2024-10-13 17:01:09,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:09,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 77 transitions. [2024-10-13 17:01:09,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 17:01:09,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 75 transitions. [2024-10-13 17:01:09,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-13 17:01:09,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-10-13 17:01:09,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2024-10-13 17:01:09,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:09,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-10-13 17:01:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2024-10-13 17:01:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2024-10-13 17:01:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-10-13 17:01:09,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-10-13 17:01:09,938 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-10-13 17:01:09,938 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:01:09,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2024-10-13 17:01:09,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-13 17:01:09,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:09,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:09,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:09,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:09,939 INFO L745 eck$LassoCheckResult]: Stem: 417#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 418#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 419#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 420#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 411#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 407#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 408#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 425#L561-2 [2024-10-13 17:01:09,939 INFO L747 eck$LassoCheckResult]: Loop: 425#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 435#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 434#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 428#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 429#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 425#L561-2 [2024-10-13 17:01:09,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849167, now seen corresponding path program 1 times [2024-10-13 17:01:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282336820] [2024-10-13 17:01:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:09,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash 35409681, now seen corresponding path program 1 times [2024-10-13 17:01:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917382761] [2024-10-13 17:01:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:09,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1594794819, now seen corresponding path program 2 times [2024-10-13 17:01:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873481200] [2024-10-13 17:01:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:09,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:10,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 17:01:10,534 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:10,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:10,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:10,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:10,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:10,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:10,535 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:10,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration4_Lasso [2024-10-13 17:01:10,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:10,535 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:10,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:10,946 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:10,946 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:10,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,950 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:10,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 17:01:10,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:10,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:10,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:10,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:10,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:10,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-13 17:01:10,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,977 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:10,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 17:01:10,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:10,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:10,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:10,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:10,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-13 17:01:11,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,003 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:11,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:01:11,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:11,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,033 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:11,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:01:11,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-10-13 17:01:11,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-13 17:01:11,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:11,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 17:01:11,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:11,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-13 17:01:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,106 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:11,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 17:01:11,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-10-13 17:01:11,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,134 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-10-13 17:01:11,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,136 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 17:01:11,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-10-13 17:01:11,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:11,156 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 17:01:11,156 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-13 17:01:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,158 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:11,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 17:01:11,159 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:11,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:01:11,170 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:11,170 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3 Supporting invariants [] [2024-10-13 17:01:11,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:11,200 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-13 17:01:11,201 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:01:11,202 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:01:11,202 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-13 17:01:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:11,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:11,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:11,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:01:11,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:11,293 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 17:01:11,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:11,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 62 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 68 states and 91 transitions. Complement of second has 11 states. [2024-10-13 17:01:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2024-10-13 17:01:11,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 5 letters. [2024-10-13 17:01:11,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:11,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2024-10-13 17:01:11,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:11,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 7 letters. Loop has 10 letters. [2024-10-13 17:01:11,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:11,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 91 transitions. [2024-10-13 17:01:11,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-13 17:01:11,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 66 states and 89 transitions. [2024-10-13 17:01:11,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-13 17:01:11,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-13 17:01:11,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 89 transitions. [2024-10-13 17:01:11,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:11,362 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 89 transitions. [2024-10-13 17:01:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 89 transitions. [2024-10-13 17:01:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-10-13 17:01:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-10-13 17:01:11,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-10-13 17:01:11,366 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-10-13 17:01:11,366 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:01:11,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 78 transitions. [2024-10-13 17:01:11,366 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2024-10-13 17:01:11,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:11,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:11,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:11,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:11,367 INFO L745 eck$LassoCheckResult]: Stem: 641#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 648#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 661#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 636#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 632#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 633#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 664#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 644#L552-1 [2024-10-13 17:01:11,367 INFO L747 eck$LassoCheckResult]: Loop: 644#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 649#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 655#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 651#L554 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;call main_#t~mem13#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1; 643#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 644#L552-1 [2024-10-13 17:01:11,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash 177749336, now seen corresponding path program 3 times [2024-10-13 17:01:11,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:11,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148893289] [2024-10-13 17:01:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:11,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash 38421593, now seen corresponding path program 3 times [2024-10-13 17:01:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974556423] [2024-10-13 17:01:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2100968094, now seen corresponding path program 1 times [2024-10-13 17:01:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736021796] [2024-10-13 17:01:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:11,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-13 17:01:11,951 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:11,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:11,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:11,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:11,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:11,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:11,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:11,952 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration5_Lasso [2024-10-13 17:01:11,952 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:11,952 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:11,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:12,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:12,377 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:12,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,378 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 17:01:12,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:12,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:12,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:12,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:12,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:12,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:12,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:12,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:12,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:12,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:12,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,409 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 17:01:12,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:12,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:12,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:12,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:12,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:12,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:12,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:12,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:12,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:12,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,437 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 17:01:12,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:12,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:12,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:12,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:12,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:12,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:12,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:12,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:12,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:12,461 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-10-13 17:01:12,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,462 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 17:01:12,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:12,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:12,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:12,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:12,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:12,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:12,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:12,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:12,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:12,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:12,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,487 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 17:01:12,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:12,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:12,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:12,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:12,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:12,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:12,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:12,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:12,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:12,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:12,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,512 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 17:01:12,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:12,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:12,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:12,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:12,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:12,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:12,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:12,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:12,542 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-13 17:01:12,542 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 17:01:12,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:12,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:12,544 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:12,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 17:01:12,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:12,559 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:01:12,559 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:12,559 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~y~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~y~0#1.base) 0)_2 Supporting invariants [] [2024-10-13 17:01:12,570 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-10-13 17:01:12,594 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-13 17:01:12,595 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-13 17:01:12,595 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-13 17:01:12,596 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-10-13 17:01:12,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:12,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:12,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:12,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:01:12,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:12,728 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 32 treesize of output 16 [2024-10-13 17:01:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:12,744 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:01:12,744 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:12,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 114 states and 145 transitions. Complement of second has 10 states. [2024-10-13 17:01:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2024-10-13 17:01:12,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:12,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:12,802 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:12,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:12,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:12,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:12,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:01:12,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:12,910 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 32 treesize of output 16 [2024-10-13 17:01:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:12,925 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:01:12,925 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:12,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 109 states and 142 transitions. Complement of second has 10 states. [2024-10-13 17:01:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-10-13 17:01:12,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:12,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:12,991 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:13,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:13,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:13,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:01:13,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:13,101 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 32 treesize of output 16 [2024-10-13 17:01:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:13,116 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:01:13,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:13,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:13,208 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 78 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 146 states and 182 transitions. Complement of second has 14 states. [2024-10-13 17:01:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-13 17:01:13,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:13,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:13,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 13 letters. Loop has 5 letters. [2024-10-13 17:01:13,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:13,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 8 letters. Loop has 10 letters. [2024-10-13 17:01:13,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:13,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 182 transitions. [2024-10-13 17:01:13,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2024-10-13 17:01:13,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 94 states and 119 transitions. [2024-10-13 17:01:13,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-10-13 17:01:13,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-13 17:01:13,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2024-10-13 17:01:13,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:13,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 119 transitions. [2024-10-13 17:01:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2024-10-13 17:01:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-10-13 17:01:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2024-10-13 17:01:13,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-10-13 17:01:13,238 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-10-13 17:01:13,238 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:01:13,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 101 transitions. [2024-10-13 17:01:13,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2024-10-13 17:01:13,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:13,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:13,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:13,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:13,242 INFO L745 eck$LassoCheckResult]: Stem: 1306#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 1310#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1358#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1351#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 1349#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 1344#L561 assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1;call main_#t~mem16#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int#1(main_#t~mem16#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem16#1;havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet17#1; 1341#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1340#L552-1 [2024-10-13 17:01:13,242 INFO L747 eck$LassoCheckResult]: Loop: 1340#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1325#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 1317#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 1318#L561 assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 1343#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1340#L552-1 [2024-10-13 17:01:13,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash 177757334, now seen corresponding path program 1 times [2024-10-13 17:01:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943503510] [2024-10-13 17:01:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:13,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:13,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:13,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 38429467, now seen corresponding path program 2 times [2024-10-13 17:01:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076714003] [2024-10-13 17:01:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:13,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:13,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -758277210, now seen corresponding path program 1 times [2024-10-13 17:01:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820101052] [2024-10-13 17:01:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:13,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:13,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:13,801 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:13,801 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:13,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:13,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:13,802 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:13,802 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:13,802 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:13,802 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:13,802 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-alloca-2.i_Iteration6_Lasso [2024-10-13 17:01:13,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:13,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:13,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:13,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:13,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:13,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:13,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:14,319 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:14,320 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:14,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:14,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:14,321 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:14,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 17:01:14,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:14,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:14,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:14,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:14,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:14,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:14,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:14,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:14,350 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-10-13 17:01:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:14,351 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:14,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 17:01:14,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:14,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:14,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:14,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:14,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:14,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:14,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:14,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:14,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:14,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:14,384 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:14,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 17:01:14,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:01:14,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:14,396 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-10-13 17:01:14,396 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-13 17:01:14,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:14,413 INFO L401 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2024-10-13 17:01:14,413 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-10-13 17:01:14,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:14,511 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-13 17:01:14,511 INFO L444 ModelExtractionUtils]: 14 out of 29 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-10-13 17:01:14,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:14,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:14,513 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:01:14,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 17:01:14,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:14,528 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2024-10-13 17:01:14,528 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:14,528 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x~0#1.base) 0)_2 + 1 Supporting invariants [] [2024-10-13 17:01:14,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-13 17:01:14,567 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-10-13 17:01:14,569 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:01:14,569 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:01:14,569 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-13 17:01:14,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:14,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:14,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:14,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:01:14,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:14,697 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 20 [2024-10-13 17:01:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:14,715 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:01:14,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:14,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 101 states and 134 transitions. Complement of second has 10 states. [2024-10-13 17:01:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2024-10-13 17:01:14,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:14,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:14,769 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:14,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:14,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:14,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:14,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:01:14,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:14,880 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 20 [2024-10-13 17:01:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:14,896 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:01:14,896 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:14,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 104 states and 137 transitions. Complement of second has 12 states. [2024-10-13 17:01:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2024-10-13 17:01:14,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:14,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:14,959 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:14,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:14,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 17:01:14,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:15,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:01:15,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:15,060 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 20 [2024-10-13 17:01:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:15,073 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2024-10-13 17:01:15,073 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:15,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 101 transitions. cyclomatic complexity: 33. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 165 states and 220 transitions. Complement of second has 12 states. [2024-10-13 17:01:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-10-13 17:01:15,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-13 17:01:15,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:15,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 13 letters. Loop has 5 letters. [2024-10-13 17:01:15,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:15,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 8 letters. Loop has 10 letters. [2024-10-13 17:01:15,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:15,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 220 transitions. [2024-10-13 17:01:15,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2024-10-13 17:01:15,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 126 states and 168 transitions. [2024-10-13 17:01:15,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-13 17:01:15,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-13 17:01:15,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 168 transitions. [2024-10-13 17:01:15,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:15,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 168 transitions. [2024-10-13 17:01:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 168 transitions. [2024-10-13 17:01:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2024-10-13 17:01:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 91 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-13 17:01:15,132 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-13 17:01:15,132 INFO L425 stractBuchiCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-13 17:01:15,132 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:01:15,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 129 transitions. [2024-10-13 17:01:15,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2024-10-13 17:01:15,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:15,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:15,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 17:01:15,133 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2024-10-13 17:01:15,133 INFO L745 eck$LassoCheckResult]: Stem: 1983#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1984#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~short8#1, main_#t~mem9#1, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~nondet17#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#0(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet5#1; 1991#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 2000#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 1978#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 1974#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 1975#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 1985#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 1987#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 2024#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 2020#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 2015#L561 assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 2016#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 2006#L552-1 [2024-10-13 17:01:15,133 INFO L747 eck$LassoCheckResult]: Loop: 2006#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 2003#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 2002#L553 assume main_#t~mem9#1 > 0;havoc main_#t~mem9#1;havoc main_#t~nondet10#1; 1995#L554 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;havoc main_#t~nondet12#1;call write~int#1(main_#t~nondet12#1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~nondet12#1; 1996#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 2014#L552-1 assume main_#t~short8#1;call main_#t~mem7#1 := read~int#1(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short8#1 := main_#t~mem7#1 > 0; 2024#L552-3 assume !!main_#t~short8#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~short8#1;call main_#t~mem9#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4); 2020#L553 assume !(main_#t~mem9#1 > 0);havoc main_#t~mem9#1;havoc main_#t~nondet14#1; 2015#L561 assume 0 != main_#t~nondet14#1;havoc main_#t~nondet14#1;call main_#t~mem15#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int#0(1 + main_#t~mem15#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem15#1; 2016#L561-2 call main_#t~mem6#1 := read~int#0(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short8#1 := 0 != main_#t~mem6#1; 2006#L552-1 [2024-10-13 17:01:15,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2100960220, now seen corresponding path program 1 times [2024-10-13 17:01:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450021365] [2024-10-13 17:01:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:15,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450021365] [2024-10-13 17:01:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450021365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:15,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 17:01:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613502799] [2024-10-13 17:01:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:15,271 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:01:15,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:15,272 INFO L85 PathProgramCache]: Analyzing trace with hash 338206529, now seen corresponding path program 1 times [2024-10-13 17:01:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205133269] [2024-10-13 17:01:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:15,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205133269] [2024-10-13 17:01:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205133269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:01:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080602729] [2024-10-13 17:01:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:01:15,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:15,368 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:01:15,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-10-13 17:01:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:15,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 17:01:15,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:15,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 17:01:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:15,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:01:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080602729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:01:15,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:01:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 17:01:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316698370] [2024-10-13 17:01:15,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:01:15,506 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 17:01:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 17:01:15,506 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. cyclomatic complexity: 43 Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:01:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:15,562 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2024-10-13 17:01:15,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2024-10-13 17:01:15,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:01:15,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2024-10-13 17:01:15,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:01:15,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:01:15,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:01:15,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:15,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:15,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 17:01:15,564 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:15,564 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:01:15,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:01:15,565 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:01:15,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:01:15,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:01:15 BoogieIcfgContainer [2024-10-13 17:01:15,571 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:01:15,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:01:15,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:01:15,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:01:15,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:06" (3/4) ... [2024-10-13 17:01:15,573 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:01:15,574 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:01:15,575 INFO L158 Benchmark]: Toolchain (without parser) took 10138.92ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 179.8MB in the beginning and 128.5MB in the end (delta: 51.3MB). Peak memory consumption was 178.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:15,575 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 125.8MB. Free memory was 88.5MB in the beginning and 88.4MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:15,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.31ms. Allocated memory is still 209.7MB. Free memory was 179.8MB in the beginning and 161.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 17:01:15,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 209.7MB. Free memory was 161.2MB in the beginning and 160.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:15,576 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 209.7MB. Free memory was 159.2MB in the beginning and 157.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:15,576 INFO L158 Benchmark]: RCFGBuilder took 307.30ms. Allocated memory is still 209.7MB. Free memory was 157.9MB in the beginning and 145.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:01:15,576 INFO L158 Benchmark]: BuchiAutomizer took 9440.05ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 145.3MB in the beginning and 128.5MB in the end (delta: 16.8MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2024-10-13 17:01:15,576 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 335.5MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:15,577 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.48ms. Allocated memory is still 125.8MB. Free memory was 88.5MB in the beginning and 88.4MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.31ms. Allocated memory is still 209.7MB. Free memory was 179.8MB in the beginning and 161.2MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 209.7MB. Free memory was 161.2MB in the beginning and 160.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 209.7MB. Free memory was 159.2MB in the beginning and 157.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.30ms. Allocated memory is still 209.7MB. Free memory was 157.9MB in the beginning and 145.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9440.05ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 145.3MB in the beginning and 128.5MB in the end (delta: 16.8MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 335.5MB. Free memory is still 128.5MB. 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~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~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~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~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~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 (2 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 9 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 7.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 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 [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 96 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax109 hnf100 lsp90 ukn68 mio100 lsp23 div100 bol105 ite100 ukn100 eq159 hnf92 smp99 dnf173 smp77 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 147ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 3 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 42 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-13 17:01:15,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:15,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-13 17:01:16,004 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