./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/array01-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:18:01,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:18:01,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:18:01,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:18:01,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:18:01,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:18:01,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:18:01,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:18:01,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:18:01,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:18:01,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:18:01,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:18:01,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:18:01,690 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:18:01,690 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:18:01,691 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:18:01,691 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:18:01,691 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:18:01,691 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:18:01,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:18:01,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:18:01,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:18:01,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:18:01,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:18:01,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:18:01,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:18:01,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:18:01,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:18:01,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:18:01,699 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:18:01,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:18:01,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:18:01,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:18:01,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:18:01,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:18:01,701 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:18:01,701 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-clean/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-clean/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 -> edc22a27a339ef391e3ea3841daa4645b584cc0ad7185141d6d001b72dd17f19 [2024-10-12 00:18:01,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:18:01,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:18:01,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:18:01,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:18:01,951 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:18:01,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2024-10-12 00:18:03,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:18:03,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:18:03,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2024-10-12 00:18:03,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/381052abd/48f9846d8e314080b51fa494f7d436eb/FLAGeb6044d1a [2024-10-12 00:18:03,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/381052abd/48f9846d8e314080b51fa494f7d436eb [2024-10-12 00:18:03,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:18:03,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:18:03,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:18:03,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:18:03,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:18:03,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:03,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5daa65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03, skipping insertion in model container [2024-10-12 00:18:03,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:03,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:18:03,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:18:03,905 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:18:03,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:18:03,978 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:18:03,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03 WrapperNode [2024-10-12 00:18:03,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:18:03,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:18:03,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:18:03,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:18:03,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,021 INFO L138 Inliner]: procedures = 111, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-10-12 00:18:04,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:18:04,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:18:04,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:18:04,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:18:04,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,044 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-12 00:18:04,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:18:04,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:18:04,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:18:04,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:18:04,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (1/1) ... [2024-10-12 00:18:04,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:04,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:04,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:18:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:18:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:18:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:18:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:18:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:18:04,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:18:04,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:18:04,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:18:04,391 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 00:18:04,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:18:04,403 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:18:04,405 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-12 00:18:04,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:04 BoogieIcfgContainer [2024-10-12 00:18:04,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:18:04,406 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:18:04,406 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:18:04,409 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:18:04,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:04,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:18:03" (1/3) ... [2024-10-12 00:18:04,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@572e9a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:18:04, skipping insertion in model container [2024-10-12 00:18:04,412 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:04,413 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:18:03" (2/3) ... [2024-10-12 00:18:04,413 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@572e9a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:18:04, skipping insertion in model container [2024-10-12 00:18:04,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:18:04,413 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:18:04" (3/3) ... [2024-10-12 00:18:04,414 INFO L332 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2024-10-12 00:18:04,463 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:18:04,464 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:18:04,464 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:18:04,464 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:18:04,464 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:18:04,464 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:18:04,464 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:18:04,464 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:18:04,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-12 00:18:04,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-12 00:18:04,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:04,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:04,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:18:04,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:04,512 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:18:04,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 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-12 00:18:04,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-12 00:18:04,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:04,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:04,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:18:04,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:04,529 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3#L561true assume !(main_~array_size~0#1 < 1); 6#L561-2true call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 11#L565-3true [2024-10-12 00:18:04,529 INFO L747 eck$LassoCheckResult]: Loop: 11#L565-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13#L565-2true main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11#L565-3true [2024-10-12 00:18:04,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-10-12 00:18:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:04,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137701798] [2024-10-12 00:18:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:04,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:04,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-10-12 00:18:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403601638] [2024-10-12 00:18:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:04,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:04,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:04,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:04,757 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-10-12 00:18:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685385920] [2024-10-12 00:18:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:04,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:04,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:05,061 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:05,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:05,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:05,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:05,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:05,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:05,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:05,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration1_Lasso [2024-10-12 00:18:05,063 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:05,063 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:05,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:05,574 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:05,577 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:05,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:05,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:05,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:18:05,584 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-12 00:18:05,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:05,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:05,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:05,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:05,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:05,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:05,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:05,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:18:05,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:05,621 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:05,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:18:05,623 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-12 00:18:05,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:05,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:05,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:05,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:05,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:05,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:05,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:05,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:05,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:05,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:18:05,658 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-12 00:18:05,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:05,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:05,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:05,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:05,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:05,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:05,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:05,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:05,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:05,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:05,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:18:05,696 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-12 00:18:05,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:05,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:05,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:05,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:05,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:05,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:05,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:05,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:05,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:18:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:05,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:05,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:18:05,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:05,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:05,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:05,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:05,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:05,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:05,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:05,756 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:05,788 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-10-12 00:18:05,788 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-10-12 00:18:05,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:05,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:05,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:18:05,799 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:05,815 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:05,816 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:05,816 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-10-12 00:18:05,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:18:05,848 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-12 00:18:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:05,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:18:05,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:05,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:18:05,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:05,931 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-12 00:18:05,961 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:18:05,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 00:18:06,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 28 states and 40 transitions. Complement of second has 6 states. [2024-10-12 00:18:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 00:18:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2024-10-12 00:18:06,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:18:06,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:06,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-12 00:18:06,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:06,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:18:06,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:06,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2024-10-12 00:18:06,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:18:06,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 12 states and 17 transitions. [2024-10-12 00:18:06,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:06,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:06,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2024-10-12 00:18:06,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:06,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-12 00:18:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2024-10-12 00:18:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 00:18:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) 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-12 00:18:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2024-10-12 00:18:06,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-12 00:18:06,048 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2024-10-12 00:18:06,048 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:18:06,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2024-10-12 00:18:06,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:18:06,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:06,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:06,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:18:06,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:18:06,050 INFO L745 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 98#L561 assume !(main_~array_size~0#1 < 1); 99#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 100#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 102#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 107#L551-3 [2024-10-12 00:18:06,050 INFO L747 eck$LassoCheckResult]: Loop: 107#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 104#L552-3 assume !true; 106#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 107#L551-3 [2024-10-12 00:18:06,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-10-12 00:18:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379333852] [2024-10-12 00:18:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:06,127 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-12 00:18:06,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379333852] [2024-10-12 00:18:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379333852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:06,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:18:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609724405] [2024-10-12 00:18:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:06,131 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:06,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 60960, now seen corresponding path program 1 times [2024-10-12 00:18:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768089593] [2024-10-12 00:18:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:06,139 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-12 00:18:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768089593] [2024-10-12 00:18:06,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768089593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:06,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:06,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:18:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581987248] [2024-10-12 00:18:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:06,140 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:18:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 00:18:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 00:18:06,143 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12 00:18:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:06,147 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2024-10-12 00:18:06,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2024-10-12 00:18:06,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:18:06,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. [2024-10-12 00:18:06,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:06,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:06,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2024-10-12 00:18:06,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:06,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:18:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2024-10-12 00:18:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-12 00:18:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-12 00:18:06,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:18:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 00:18:06,151 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:18:06,151 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:18:06,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-12 00:18:06,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:18:06,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:06,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:06,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:18:06,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:18:06,152 INFO L745 eck$LassoCheckResult]: Stem: 139#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 140#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 129#L561 assume !(main_~array_size~0#1 < 1); 130#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 131#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 133#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 138#L551-3 [2024-10-12 00:18:06,152 INFO L747 eck$LassoCheckResult]: Loop: 138#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 135#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 136#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 137#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 138#L551-3 [2024-10-12 00:18:06,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 2 times [2024-10-12 00:18:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691227175] [2024-10-12 00:18:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:06,199 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-12 00:18:06,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:06,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691227175] [2024-10-12 00:18:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691227175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:18:06,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:18:06,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:18:06,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313016023] [2024-10-12 00:18:06,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:18:06,200 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2024-10-12 00:18:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941050783] [2024-10-12 00:18:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:06,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:18:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:18:06,253 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 00:18:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:06,271 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2024-10-12 00:18:06,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2024-10-12 00:18:06,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:18:06,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2024-10-12 00:18:06,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:06,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:06,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2024-10-12 00:18:06,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:18:06,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-12 00:18:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2024-10-12 00:18:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-10-12 00:18:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2024-10-12 00:18:06,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:18:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:18:06,278 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2024-10-12 00:18:06,278 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:18:06,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2024-10-12 00:18:06,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:18:06,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:06,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:06,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:06,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:18:06,279 INFO L745 eck$LassoCheckResult]: Stem: 171#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 172#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 161#L561 assume !(main_~array_size~0#1 < 1); 162#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 163#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 164#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 165#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 166#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 170#L551-3 [2024-10-12 00:18:06,279 INFO L747 eck$LassoCheckResult]: Loop: 170#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 167#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 168#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 169#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 170#L551-3 [2024-10-12 00:18:06,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-10-12 00:18:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641319878] [2024-10-12 00:18:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:06,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2024-10-12 00:18:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756766765] [2024-10-12 00:18:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:06,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2024-10-12 00:18:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099506834] [2024-10-12 00:18:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:06,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:06,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:18:06,665 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:06,665 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:06,665 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:06,665 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:06,666 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:06,666 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:06,666 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:06,666 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:06,666 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration4_Lasso [2024-10-12 00:18:06,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:06,666 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:06,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:06,994 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:06,995 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:06,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:06,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:06,996 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:18:07,014 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-12 00:18:07,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:07,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:07,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:18:07,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:18:07,064 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-12 00:18:07,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:18:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:18:07,113 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-12 00:18:07,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:18:07,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:18:07,144 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-12 00:18:07,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:18:07,170 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-12 00:18:07,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:18:07,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:18:07,214 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-12 00:18:07,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:18:07,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,254 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:18:07,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:07,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,280 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:18:07,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,300 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:18:07,309 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-12 00:18:07,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:18:07,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:07,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:07,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:07,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-12 00:18:07,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,374 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:18:07,376 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-12 00:18:07,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:07,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:07,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:07,388 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:18:07,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,405 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:18:07,408 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-12 00:18:07,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:07,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:07,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:18:07,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,452 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:18:07,455 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-12 00:18:07,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:07,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:07,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:18:07,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,497 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:18:07,503 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-12 00:18:07,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:07,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:07,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:07,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:07,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,545 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:18:07,547 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-12 00:18:07,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:07,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:07,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:07,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:07,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:07,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:07,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:07,603 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2024-10-12 00:18:07,603 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-10-12 00:18:07,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:07,607 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:07,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:18:07,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:07,635 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:07,635 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:07,635 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, ULTIMATE.start_test_fun_~N#1) = -1*ULTIMATE.start_test_fun_~i~0#1 + 1*ULTIMATE.start_test_fun_~N#1 Supporting invariants [] [2024-10-12 00:18:07,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:07,659 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-12 00:18:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:07,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:18:07,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:07,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:18:07,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:07,739 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-12 00:18:07,740 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:18:07,740 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:07,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 22 transitions. Complement of second has 4 states. [2024-10-12 00:18:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2024-10-12 00:18:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-12 00:18:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:18:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:07,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2024-10-12 00:18:07,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:07,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2024-10-12 00:18:07,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:07,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2024-10-12 00:18:07,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:07,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:18:07,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2024-10-12 00:18:07,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:07,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-12 00:18:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2024-10-12 00:18:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-10-12 00:18:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-12 00:18:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-12 00:18:07,770 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-12 00:18:07,770 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-12 00:18:07,770 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:18:07,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-12 00:18:07,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:07,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:07,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:07,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:07,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:07,774 INFO L745 eck$LassoCheckResult]: Stem: 270#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 257#L561 assume !(main_~array_size~0#1 < 1); 258#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 259#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 260#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 261#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 262#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 269#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 263#L552-3 [2024-10-12 00:18:07,774 INFO L747 eck$LassoCheckResult]: Loop: 263#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 264#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 263#L552-3 [2024-10-12 00:18:07,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2024-10-12 00:18:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752931364] [2024-10-12 00:18:07,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:07,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:07,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:07,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2024-10-12 00:18:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:07,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847030018] [2024-10-12 00:18:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:07,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:07,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2024-10-12 00:18:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742877102] [2024-10-12 00:18:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:07,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:07,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:08,070 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:08,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:08,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:08,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:08,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:08,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:08,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:08,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration5_Lasso [2024-10-12 00:18:08,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:08,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:08,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:18:08,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:08,386 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:08,386 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,391 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:18:08,392 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-12 00:18:08,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:08,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:08,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:08,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:08,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:08,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,417 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:18:08,420 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-12 00:18:08,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:08,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:08,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:08,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:08,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:08,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,446 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:18:08,448 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-12 00:18:08,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:08,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:08,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:08,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:08,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,475 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:18:08,477 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-12 00:18:08,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:08,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:08,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:08,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:08,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,505 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:18:08,507 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-12 00:18:08,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:08,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:08,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:08,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-12 00:18:08,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,539 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:18:08,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:08,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:08,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:08,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:08,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,577 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:18:08,580 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-12 00:18:08,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:08,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:08,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:08,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:08,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:08,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:08,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:08,609 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:18:08,609 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:18:08,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,611 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:18:08,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:08,624 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:08,624 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:08,624 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) ULTIMATE.start_test_fun_~a#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) ULTIMATE.start_test_fun_~a#1.offset)_2 Supporting invariants [] [2024-10-12 00:18:08,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:08,644 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:18:08,647 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:08,648 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:08,648 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:08,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:18:08,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:08,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:08,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:08,743 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-12 00:18:08,743 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-12 00:18:08,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:08,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 9 states. [2024-10-12 00:18:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2024-10-12 00:18:08,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2024-10-12 00:18:08,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:08,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2024-10-12 00:18:08,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:08,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:18:08,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:08,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-10-12 00:18:08,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:08,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2024-10-12 00:18:08,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:08,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:08,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2024-10-12 00:18:08,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:08,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-12 00:18:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2024-10-12 00:18:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-10-12 00:18:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-12 00:18:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-10-12 00:18:08,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-12 00:18:08,794 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-12 00:18:08,794 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:18:08,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2024-10-12 00:18:08,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:08,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:08,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:08,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:08,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:08,798 INFO L745 eck$LassoCheckResult]: Stem: 390#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 382#L561 assume !(main_~array_size~0#1 < 1); 383#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 384#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 385#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 386#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 387#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 392#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 393#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 395#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 388#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 389#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 378#L552-3 [2024-10-12 00:18:08,799 INFO L747 eck$LassoCheckResult]: Loop: 378#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 379#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 378#L552-3 [2024-10-12 00:18:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2024-10-12 00:18:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129457964] [2024-10-12 00:18:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:08,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129457964] [2024-10-12 00:18:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129457964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109855146] [2024-10-12 00:18:08,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:18:08,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:08,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:08,892 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:08,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-12 00:18:08,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:18:08,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:08,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 00:18:08,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:08,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109855146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:09,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:09,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 00:18:09,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010174463] [2024-10-12 00:18:09,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:09,034 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2024-10-12 00:18:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682379006] [2024-10-12 00:18:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:09,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 00:18:09,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-12 00:18:09,079 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 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-12 00:18:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:09,161 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-12 00:18:09,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-10-12 00:18:09,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:09,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2024-10-12 00:18:09,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:09,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:09,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-10-12 00:18:09,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:09,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 00:18:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-10-12 00:18:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-12 00:18:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 00:18:09,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:18:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 00:18:09,169 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:18:09,169 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:18:09,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-10-12 00:18:09,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:09,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:09,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:09,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:09,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:09,170 INFO L745 eck$LassoCheckResult]: Stem: 533#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 534#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 521#L561 assume !(main_~array_size~0#1 < 1); 522#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 527#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 528#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 529#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 530#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 540#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 538#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 535#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 536#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 539#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 531#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 532#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 523#L552-3 [2024-10-12 00:18:09,170 INFO L747 eck$LassoCheckResult]: Loop: 523#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 524#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 523#L552-3 [2024-10-12 00:18:09,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2024-10-12 00:18:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729486237] [2024-10-12 00:18:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:09,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2024-10-12 00:18:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137003474] [2024-10-12 00:18:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2024-10-12 00:18:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740527885] [2024-10-12 00:18:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:09,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:09,517 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:09,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:09,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:09,518 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:09,518 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:09,518 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:09,518 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:09,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:09,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration7_Lasso [2024-10-12 00:18:09,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:09,518 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:09,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:09,883 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:09,884 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:09,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:09,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:09,886 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:09,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:18:09,887 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-12 00:18:09,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:09,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:09,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:09,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:09,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:09,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:09,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:09,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:18:09,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:09,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:09,915 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:09,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:18:09,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:09,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:09,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:09,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:09,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:09,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:09,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:09,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:09,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:09,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:18:09,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:09,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:09,941 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:09,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:18:09,944 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-12 00:18:09,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:09,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:09,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:09,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:09,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:09,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:09,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:09,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:09,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-12 00:18:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:09,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:09,969 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:09,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-12 00:18:09,970 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-12 00:18:09,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:09,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:09,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:09,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:09,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:09,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:09,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:09,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:09,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:09,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:09,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:09,995 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:09,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-12 00:18:09,997 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-12 00:18:10,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-12 00:18:10,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,022 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-12 00:18:10,024 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-12 00:18:10,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,051 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-12 00:18:10,052 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-12 00:18:10,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-12 00:18:10,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,077 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-12 00:18:10,079 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-12 00:18:10,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,107 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-12 00:18:10,110 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-12 00:18:10,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-12 00:18:10,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,146 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-12 00:18:10,155 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-12 00:18:10,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:10,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:10,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-12 00:18:10,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,193 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-12 00:18:10,199 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-12 00:18:10,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-10-12 00:18:10,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,232 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-12 00:18:10,245 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-12 00:18:10,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-12 00:18:10,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,282 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-12 00:18:10,285 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-12 00:18:10,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-12 00:18:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,316 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-12 00:18:10,318 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-12 00:18:10,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,342 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-12 00:18:10,345 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-12 00:18:10,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:10,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:10,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:10,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,370 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-12 00:18:10,372 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-12 00:18:10,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:10,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:10,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,400 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-12 00:18:10,402 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-12 00:18:10,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:10,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:10,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,436 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-12 00:18:10,441 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-12 00:18:10,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:10,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:10,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,470 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-12 00:18:10,472 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-12 00:18:10,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:10,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:10,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:10,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,502 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-12 00:18:10,503 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-12 00:18:10,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:10,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:10,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:10,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:10,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:10,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:10,524 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:10,538 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:18:10,538 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:18:10,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:10,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:10,540 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:10,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-12 00:18:10,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:10,566 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:10,566 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:10,566 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1 Supporting invariants [] [2024-10-12 00:18:10,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-12 00:18:10,599 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2024-10-12 00:18:10,602 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:10,602 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:10,603 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:10,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:10,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:18:10,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:10,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:10,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:10,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-12 00:18:10,774 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-12 00:18:10,775 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-12 00:18:10,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:10,801 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 5 states. [2024-10-12 00:18:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:10,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-12 00:18:10,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:10,804 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:10,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:10,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:18:10,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:10,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:10,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:10,931 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-12 00:18:10,932 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-12 00:18:10,932 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:10,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 26 transitions. Complement of second has 5 states. [2024-10-12 00:18:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:10,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-12 00:18:10,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:10,960 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:10,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:10,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:18:10,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:11,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:11,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:11,089 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-12 00:18:11,090 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-12 00:18:11,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:11,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 43 transitions. Complement of second has 11 states. [2024-10-12 00:18:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2024-10-12 00:18:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 15 letters. Loop has 2 letters. [2024-10-12 00:18:11,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 17 letters. Loop has 2 letters. [2024-10-12 00:18:11,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:11,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-12 00:18:11,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:11,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-10-12 00:18:11,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:11,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 36 transitions. [2024-10-12 00:18:11,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:11,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:11,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2024-10-12 00:18:11,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:11,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-12 00:18:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2024-10-12 00:18:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-12 00:18:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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-12 00:18:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-12 00:18:11,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-12 00:18:11,168 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-12 00:18:11,168 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:18:11,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-10-12 00:18:11,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:11,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:11,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:11,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:11,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:11,170 INFO L745 eck$LassoCheckResult]: Stem: 871#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 872#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 859#L561 assume !(main_~array_size~0#1 < 1); 860#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 861#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 862#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 863#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 864#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 875#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 874#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 867#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 868#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 877#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 876#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 869#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 870#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 879#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 865#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 866#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 855#L552-3 [2024-10-12 00:18:11,170 INFO L747 eck$LassoCheckResult]: Loop: 855#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 856#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 855#L552-3 [2024-10-12 00:18:11,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1359773592, now seen corresponding path program 4 times [2024-10-12 00:18:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3888411] [2024-10-12 00:18:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:11,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3888411] [2024-10-12 00:18:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3888411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037431570] [2024-10-12 00:18:11,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:18:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:11,290 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-10-12 00:18:11,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:18:11,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:11,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:18:11,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:11,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037431570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:11,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-12 00:18:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326324809] [2024-10-12 00:18:11,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:11,463 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:11,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2024-10-12 00:18:11,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490303802] [2024-10-12 00:18:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 00:18:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:18:11,510 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 10 Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 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-12 00:18:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:11,574 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-12 00:18:11,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2024-10-12 00:18:11,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:11,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 33 transitions. [2024-10-12 00:18:11,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:11,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:11,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-10-12 00:18:11,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:11,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-12 00:18:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-10-12 00:18:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-12 00:18:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-12 00:18:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-12 00:18:11,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-12 00:18:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 00:18:11,580 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-12 00:18:11,580 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:18:11,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2024-10-12 00:18:11,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:11,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:11,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:11,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:11,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:11,581 INFO L745 eck$LassoCheckResult]: Stem: 1060#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1061#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1049#L561 assume !(main_~array_size~0#1 < 1); 1050#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 1051#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1052#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1053#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1054#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1071#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1070#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1069#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1063#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1057#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1058#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1067#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1055#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1056#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1059#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1066#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1065#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1064#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1045#L552-3 [2024-10-12 00:18:11,581 INFO L747 eck$LassoCheckResult]: Loop: 1045#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1046#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 1045#L552-3 [2024-10-12 00:18:11,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1255193994, now seen corresponding path program 5 times [2024-10-12 00:18:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:11,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444630563] [2024-10-12 00:18:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:11,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 5 times [2024-10-12 00:18:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334752536] [2024-10-12 00:18:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:11,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash 644383099, now seen corresponding path program 2 times [2024-10-12 00:18:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110489266] [2024-10-12 00:18:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:11,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:12,004 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:12,005 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:12,005 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:12,005 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:12,005 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:12,005 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,005 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:12,005 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:12,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration9_Lasso [2024-10-12 00:18:12,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:12,005 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:12,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:12,425 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:12,425 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:12,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,427 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-12 00:18:12,429 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-12 00:18:12,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:12,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,469 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-12 00:18:12,474 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-12 00:18:12,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-12 00:18:12,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,500 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-12 00:18:12,501 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-12 00:18:12,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-12 00:18:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,527 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-12 00:18:12,529 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-12 00:18:12,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-12 00:18:12,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,560 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-12 00:18:12,562 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-12 00:18:12,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-12 00:18:12,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,597 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-12 00:18:12,598 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-12 00:18:12,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:12,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,623 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-12 00:18:12,625 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-12 00:18:12,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-10-12 00:18:12,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,649 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-12 00:18:12,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:12,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-12 00:18:12,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,678 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-12 00:18:12,679 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-12 00:18:12,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:12,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,705 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-12 00:18:12,707 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-12 00:18:12,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-12 00:18:12,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,733 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-10-12 00:18:12,734 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-12 00:18:12,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,758 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-12 00:18:12,760 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-12 00:18:12,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:12,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:12,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:12,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-10-12 00:18:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,784 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-12 00:18:12,786 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-12 00:18:12,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-10-12 00:18:12,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,817 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-12 00:18:12,819 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-12 00:18:12,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-12 00:18:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,851 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-12 00:18:12,854 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-12 00:18:12,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:12,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,885 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-12 00:18:12,887 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-12 00:18:12,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-12 00:18:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,919 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-12 00:18:12,920 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-12 00:18:12,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-10-12 00:18:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,952 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-12 00:18:12,954 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-12 00:18:12,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:12,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-10-12 00:18:12,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:12,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:12,979 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:12,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-12 00:18:12,981 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-12 00:18:12,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:12,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:12,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:12,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:12,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:12,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:12,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:13,002 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:18:13,003 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-12 00:18:13,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:13,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:13,004 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:13,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-12 00:18:13,005 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:13,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:13,016 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:13,016 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 8)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 8)_1 Supporting invariants [] [2024-10-12 00:18:13,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-10-12 00:18:13,044 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2024-10-12 00:18:13,047 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:13,047 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:13,047 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:13,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 00:18:13,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:13,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-10-12 00:18:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:13,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:13,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:13,290 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-12 00:18:13,291 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-12 00:18:13,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12 00:18:13,325 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 28 states and 34 transitions. Complement of second has 5 states. [2024-10-12 00:18:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12 00:18:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:13,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2024-10-12 00:18:13,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:13,326 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:13,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:13,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 00:18:13,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:13,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:13,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:13,568 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-12 00:18:13,569 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-12 00:18:13,569 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12 00:18:13,591 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 28 states and 34 transitions. Complement of second has 5 states. [2024-10-12 00:18:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12 00:18:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 21 letters. Loop has 2 letters. [2024-10-12 00:18:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:13,594 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:13,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:13,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 00:18:13,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:13,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:13,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:13,813 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-12 00:18:13,814 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-12 00:18:13,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12 00:18:13,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 10. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 43 states and 53 transitions. Complement of second has 13 states. [2024-10-12 00:18:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-12 00:18:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2024-10-12 00:18:13,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 21 letters. Loop has 2 letters. [2024-10-12 00:18:13,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:13,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 23 letters. Loop has 2 letters. [2024-10-12 00:18:13,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:13,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 35 transitions. Stem has 21 letters. Loop has 4 letters. [2024-10-12 00:18:13,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:13,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2024-10-12 00:18:13,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:13,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 38 states and 46 transitions. [2024-10-12 00:18:13,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:13,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:13,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2024-10-12 00:18:13,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:13,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-12 00:18:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2024-10-12 00:18:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-10-12 00:18:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-12 00:18:13,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-12 00:18:13,921 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-12 00:18:13,924 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:18:13,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2024-10-12 00:18:13,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:13,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:13,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:13,925 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:13,925 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:13,925 INFO L745 eck$LassoCheckResult]: Stem: 1488#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1480#L561 assume !(main_~array_size~0#1 < 1); 1481#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 1482#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1483#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1484#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1485#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1495#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1494#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1493#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1492#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1490#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1477#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1478#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1486#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1487#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1491#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1505#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1504#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1503#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1502#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1499#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1498#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1496#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1475#L552-3 [2024-10-12 00:18:13,925 INFO L747 eck$LassoCheckResult]: Loop: 1475#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1476#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 1475#L552-3 [2024-10-12 00:18:13,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash 776867019, now seen corresponding path program 6 times [2024-10-12 00:18:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189830167] [2024-10-12 00:18:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189830167] [2024-10-12 00:18:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189830167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:14,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260410197] [2024-10-12 00:18:14,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:18:14,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:14,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:14,050 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:14,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2024-10-12 00:18:14,110 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-10-12 00:18:14,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:14,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:18:14,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:14,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:14,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260410197] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:14,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:14,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-12 00:18:14,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659390545] [2024-10-12 00:18:14,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:14,299 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:14,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 6 times [2024-10-12 00:18:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45868661] [2024-10-12 00:18:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 00:18:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-12 00:18:14,351 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. cyclomatic complexity: 12 Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 17 states have internal predecessors, (47), 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-12 00:18:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:14,466 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-12 00:18:14,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2024-10-12 00:18:14,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:14,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 35 states and 41 transitions. [2024-10-12 00:18:14,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:14,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:14,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2024-10-12 00:18:14,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:14,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-12 00:18:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2024-10-12 00:18:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-10-12 00:18:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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-12 00:18:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-12 00:18:14,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-12 00:18:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 00:18:14,472 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-12 00:18:14,472 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:18:14,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2024-10-12 00:18:14,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:14,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:14,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:14,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:14,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:14,473 INFO L745 eck$LassoCheckResult]: Stem: 1736#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1737#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1723#L561 assume !(main_~array_size~0#1 < 1); 1724#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 1725#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1726#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1727#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1728#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1750#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1749#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1748#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 1746#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1745#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1740#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 1738#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1739#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1755#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1734#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1735#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1731#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1732#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1747#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1754#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1753#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1744#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 1743#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 1741#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 1729#L552-3 [2024-10-12 00:18:14,473 INFO L747 eck$LassoCheckResult]: Loop: 1729#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 1730#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 1729#L552-3 [2024-10-12 00:18:14,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash -914443991, now seen corresponding path program 7 times [2024-10-12 00:18:14,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:14,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341683610] [2024-10-12 00:18:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:14,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:14,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 7 times [2024-10-12 00:18:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:14,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899191429] [2024-10-12 00:18:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:14,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1687621486, now seen corresponding path program 3 times [2024-10-12 00:18:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894986429] [2024-10-12 00:18:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:14,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:15,200 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:15,200 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:15,200 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:15,200 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:15,200 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:15,200 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,200 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:15,200 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:15,200 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration11_Lasso [2024-10-12 00:18:15,200 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:15,200 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:15,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:15,769 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:15,770 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:15,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,774 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-12 00:18:15,783 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-12 00:18:15,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:15,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:15,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:15,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:15,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-10-12 00:18:15,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,819 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-12 00:18:15,823 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-12 00:18:15,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:15,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:15,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:15,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:15,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-10-12 00:18:15,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,861 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-12 00:18:15,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-12 00:18:15,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:15,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:15,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:15,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:15,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-12 00:18:15,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,894 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-12 00:18:15,896 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-12 00:18:15,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:15,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:15,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:15,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:15,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,923 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-10-12 00:18:15,924 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-12 00:18:15,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:15,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:15,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:15,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:15,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:15,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,954 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-12 00:18:15,955 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-12 00:18:15,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:15,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:15,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:15,966 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:15,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-12 00:18:15,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:15,978 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:15,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-12 00:18:15,979 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-12 00:18:15,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:15,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:15,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:15,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:15,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:15,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:15,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:15,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-10-12 00:18:16,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,003 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-12 00:18:16,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:16,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:16,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,028 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-12 00:18:16,029 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-12 00:18:16,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-10-12 00:18:16,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,054 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-12 00:18:16,056 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-12 00:18:16,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-10-12 00:18:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,091 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-12 00:18:16,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:16,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-10-12 00:18:16,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,116 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-12 00:18:16,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:16,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-10-12 00:18:16,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,145 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-12 00:18:16,148 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-12 00:18:16,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-10-12 00:18:16,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,175 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-12 00:18:16,176 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-12 00:18:16,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-12 00:18:16,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,205 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-12 00:18:16,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:16,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-12 00:18:16,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,230 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-10-12 00:18:16,231 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-12 00:18:16,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-10-12 00:18:16,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,256 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-12 00:18:16,257 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-12 00:18:16,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,280 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-12 00:18:16,282 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-12 00:18:16,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,293 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-10-12 00:18:16,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,310 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-12 00:18:16,311 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-12 00:18:16,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:16,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:16,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:16,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-12 00:18:16,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,337 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-12 00:18:16,338 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-12 00:18:16,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-12 00:18:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,370 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-12 00:18:16,371 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-12 00:18:16,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-10-12 00:18:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,399 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-12 00:18:16,400 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-12 00:18:16,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-12 00:18:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,442 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-12 00:18:16,446 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-12 00:18:16,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-12 00:18:16,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,480 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-12 00:18:16,481 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-12 00:18:16,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:16,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-12 00:18:16,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,509 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-12 00:18:16,510 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-12 00:18:16,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:16,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:16,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:16,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:16,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:16,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:16,531 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:16,538 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 00:18:16,538 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:18:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:16,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:16,540 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:16,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-12 00:18:16,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:16,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:16,553 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:16,553 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 12))_1 Supporting invariants [] [2024-10-12 00:18:16,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-12 00:18:16,576 INFO L156 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:18:16,578 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:16,578 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:16,579 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:16,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:16,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:16,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:16,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:16,760 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-12 00:18:16,760 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-12 00:18:16,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-12 00:18:16,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 35 states and 42 transitions. Complement of second has 5 states. [2024-10-12 00:18:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-12 00:18:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:16,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-12 00:18:16,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:16,790 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:16,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:16,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:16,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:16,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:16,951 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-12 00:18:16,952 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-12 00:18:16,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-12 00:18:16,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 35 states and 42 transitions. Complement of second has 5 states. [2024-10-12 00:18:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-12 00:18:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:16,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-12 00:18:16,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:16,974 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:17,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:17,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:17,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:17,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:17,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-12 00:18:17,172 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-12 00:18:17,172 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-12 00:18:17,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-12 00:18:17,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 51 states and 63 transitions. Complement of second has 15 states. [2024-10-12 00:18:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-12 00:18:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2024-10-12 00:18:17,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-12 00:18:17,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:17,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 29 letters. Loop has 2 letters. [2024-10-12 00:18:17,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:17,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 41 transitions. Stem has 27 letters. Loop has 4 letters. [2024-10-12 00:18:17,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:17,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2024-10-12 00:18:17,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:17,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 46 states and 56 transitions. [2024-10-12 00:18:17,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:17,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:17,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2024-10-12 00:18:17,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:17,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-12 00:18:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2024-10-12 00:18:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-10-12 00:18:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-12 00:18:17,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-12 00:18:17,296 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-12 00:18:17,296 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:18:17,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2024-10-12 00:18:17,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:17,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:17,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:17,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:17,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:17,297 INFO L745 eck$LassoCheckResult]: Stem: 2258#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2252#L561 assume !(main_~array_size~0#1 < 1); 2253#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 2243#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2244#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2245#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2246#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2265#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2264#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2263#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2262#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2261#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2260#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2256#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2249#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2250#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2254#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2255#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2257#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2280#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2279#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2278#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2276#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2275#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2274#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2273#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2272#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2269#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2268#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2266#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2247#L552-3 [2024-10-12 00:18:17,297 INFO L747 eck$LassoCheckResult]: Loop: 2247#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2248#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 2247#L552-3 [2024-10-12 00:18:17,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:17,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1693390338, now seen corresponding path program 8 times [2024-10-12 00:18:17,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997992109] [2024-10-12 00:18:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:17,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:17,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997992109] [2024-10-12 00:18:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997992109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977647808] [2024-10-12 00:18:17,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:18:17,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:17,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,449 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:17,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2024-10-12 00:18:17,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:18:17,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:17,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:18:17,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:17,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977647808] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:17,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-10-12 00:18:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408307814] [2024-10-12 00:18:17,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:17,753 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:17,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 8 times [2024-10-12 00:18:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:17,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589458979] [2024-10-12 00:18:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:17,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 00:18:17,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-10-12 00:18:17,814 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 14 Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-12 00:18:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:17,907 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-12 00:18:17,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 75 transitions. [2024-10-12 00:18:17,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:17,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 42 states and 49 transitions. [2024-10-12 00:18:17,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:17,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:17,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 49 transitions. [2024-10-12 00:18:17,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:17,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-12 00:18:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 49 transitions. [2024-10-12 00:18:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-12 00:18:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.170731707317073) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-12 00:18:17,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-12 00:18:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:18:17,912 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-12 00:18:17,912 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:18:17,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 48 transitions. [2024-10-12 00:18:17,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:17,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:17,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:17,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:17,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:17,913 INFO L745 eck$LassoCheckResult]: Stem: 2565#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2566#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2558#L561 assume !(main_~array_size~0#1 < 1); 2559#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 2549#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2550#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2551#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2552#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2560#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2578#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2577#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2576#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2575#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 2572#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2571#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2567#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 2563#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2555#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2556#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2561#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2562#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2564#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2588#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2587#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2586#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2584#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2583#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2582#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2581#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2580#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2573#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 2570#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 2568#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 2553#L552-3 [2024-10-12 00:18:17,913 INFO L747 eck$LassoCheckResult]: Loop: 2553#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 2554#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 2553#L552-3 [2024-10-12 00:18:17,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash -54505508, now seen corresponding path program 9 times [2024-10-12 00:18:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444443387] [2024-10-12 00:18:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:17,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 9 times [2024-10-12 00:18:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929491580] [2024-10-12 00:18:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:17,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash -840184479, now seen corresponding path program 4 times [2024-10-12 00:18:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962631287] [2024-10-12 00:18:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:17,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:18,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:18,794 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:18,795 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:18,795 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:18,795 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:18,795 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:18,795 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:18,795 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:18,795 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:18,795 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration13_Lasso [2024-10-12 00:18:18,795 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:18,795 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:18,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:18,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:19,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:19,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:19,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:19,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:19,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:19,240 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:19,241 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,242 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-12 00:18:19,244 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-12 00:18:19,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-10-12 00:18:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,284 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-10-12 00:18:19,289 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-12 00:18:19,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:19,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:19,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:19,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,321 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-12 00:18:19,323 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-12 00:18:19,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:19,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,360 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-12 00:18:19,366 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-12 00:18:19,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,400 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-12 00:18:19,402 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-12 00:18:19,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:19,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:19,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-10-12 00:18:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,430 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-12 00:18:19,431 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-12 00:18:19,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-12 00:18:19,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,458 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-12 00:18:19,459 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-12 00:18:19,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-12 00:18:19,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,490 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-12 00:18:19,492 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-12 00:18:19,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-12 00:18:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,515 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-12 00:18:19,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-12 00:18:19,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:19,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:19,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-10-12 00:18:19,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,546 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-12 00:18:19,547 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-12 00:18:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-10-12 00:18:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,573 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-12 00:18:19,575 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-12 00:18:19,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-10-12 00:18:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,601 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-10-12 00:18:19,602 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-12 00:18:19,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-10-12 00:18:19,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,627 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-10-12 00:18:19,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:19,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:19,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,656 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-10-12 00:18:19,658 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-12 00:18:19,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:19,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:19,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-10-12 00:18:19,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,688 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-10-12 00:18:19,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:19,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-10-12 00:18:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,716 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-10-12 00:18:19,717 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-12 00:18:19,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:19,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:19,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:19,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-10-12 00:18:19,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,744 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-10-12 00:18:19,756 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-12 00:18:19,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:19,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:19,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:19,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-10-12 00:18:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,788 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-10-12 00:18:19,789 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-12 00:18:19,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:19,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:19,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:19,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:19,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:19,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:19,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:19,812 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:18:19,813 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-12 00:18:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:19,814 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:19,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-10-12 00:18:19,815 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:19,826 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:19,826 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:19,826 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1 Supporting invariants [] [2024-10-12 00:18:19,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-10-12 00:18:19,854 INFO L156 tatePredicateManager]: 7 out of 9 supporting invariants were superfluous and have been removed [2024-10-12 00:18:19,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:19,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:19,857 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:19,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:18:19,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,071 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-12 00:18:20,072 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-10-12 00:18:20,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-12 00:18:20,104 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 42 states and 50 transitions. Complement of second has 5 states. [2024-10-12 00:18:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-12 00:18:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:20,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 33 letters. Loop has 2 letters. [2024-10-12 00:18:20,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:20,105 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:20,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,299 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-12 00:18:20,299 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2024-10-12 00:18:20,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-12 00:18:20,322 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 42 states and 50 transitions. Complement of second has 5 states. [2024-10-12 00:18:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-12 00:18:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 33 letters. Loop has 2 letters. [2024-10-12 00:18:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:20,323 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:20,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,513 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-12 00:18:20,513 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-10-12 00:18:20,514 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-12 00:18:20,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 48 transitions. cyclomatic complexity: 14. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 59 states and 73 transitions. Complement of second has 17 states. [2024-10-12 00:18:20,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-12 00:18:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2024-10-12 00:18:20,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 33 letters. Loop has 2 letters. [2024-10-12 00:18:20,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:20,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 35 letters. Loop has 2 letters. [2024-10-12 00:18:20,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:20,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 47 transitions. Stem has 33 letters. Loop has 4 letters. [2024-10-12 00:18:20,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:20,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2024-10-12 00:18:20,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:20,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 54 states and 66 transitions. [2024-10-12 00:18:20,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:20,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:20,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2024-10-12 00:18:20,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:20,622 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-10-12 00:18:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2024-10-12 00:18:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-10-12 00:18:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.173913043478261) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-12 00:18:20,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-12 00:18:20,624 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-12 00:18:20,625 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-12 00:18:20,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-12 00:18:20,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:20,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:20,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:20,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:20,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:20,626 INFO L745 eck$LassoCheckResult]: Stem: 3176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3162#L561 assume !(main_~array_size~0#1 < 1); 3163#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 3164#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3165#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3166#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3167#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3173#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3187#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3186#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3185#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3184#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3183#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3182#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3181#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3178#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3179#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3206#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3205#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3180#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3170#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3171#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3174#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3175#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3203#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3202#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3201#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3200#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3198#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3197#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3196#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3195#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3194#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3191#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3190#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3188#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3168#L552-3 [2024-10-12 00:18:20,626 INFO L747 eck$LassoCheckResult]: Loop: 3168#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3169#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 3168#L552-3 [2024-10-12 00:18:20,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash 36566833, now seen corresponding path program 10 times [2024-10-12 00:18:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:20,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811597918] [2024-10-12 00:18:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:20,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811597918] [2024-10-12 00:18:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811597918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107287870] [2024-10-12 00:18:20,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:18:20,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:20,882 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2024-10-12 00:18:20,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:18:20,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:20,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:21,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:21,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:21,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107287870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:21,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:21,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-10-12 00:18:21,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462901256] [2024-10-12 00:18:21,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:21,307 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:21,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 10 times [2024-10-12 00:18:21,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:21,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265458899] [2024-10-12 00:18:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 00:18:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2024-10-12 00:18:21,346 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 23 states have internal predecessors, (67), 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-12 00:18:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:21,441 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-10-12 00:18:21,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 89 transitions. [2024-10-12 00:18:21,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:21,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 57 transitions. [2024-10-12 00:18:21,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:21,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:21,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 57 transitions. [2024-10-12 00:18:21,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:21,442 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-12 00:18:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 57 transitions. [2024-10-12 00:18:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-12 00:18:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 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-12 00:18:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-10-12 00:18:21,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-12 00:18:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 00:18:21,448 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-10-12 00:18:21,448 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-12 00:18:21,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2024-10-12 00:18:21,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:21,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:21,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:21,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:21,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:21,453 INFO L745 eck$LassoCheckResult]: Stem: 3543#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3544#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3535#L561 assume !(main_~array_size~0#1 < 1); 3536#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 3526#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3527#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3528#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3529#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3537#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3558#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3557#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3556#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3555#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3554#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3553#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 3550#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3549#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3545#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 3540#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3541#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3572#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3571#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3542#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3532#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3533#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3538#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3539#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3569#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3568#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3567#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3566#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3564#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3563#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3562#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3561#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3560#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3551#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 3548#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 3546#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 3530#L552-3 [2024-10-12 00:18:21,453 INFO L747 eck$LassoCheckResult]: Loop: 3530#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 3531#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 3530#L552-3 [2024-10-12 00:18:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash -643498353, now seen corresponding path program 11 times [2024-10-12 00:18:21,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426197500] [2024-10-12 00:18:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:21,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 11 times [2024-10-12 00:18:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648309829] [2024-10-12 00:18:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:21,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash 73374548, now seen corresponding path program 5 times [2024-10-12 00:18:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780420498] [2024-10-12 00:18:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:21,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:21,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:22,918 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:22,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:22,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:22,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:22,918 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:22,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:22,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:22,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:22,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration15_Lasso [2024-10-12 00:18:22,919 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:22,919 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:22,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:22,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:22,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:22,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:22,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:22,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:22,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:23,543 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:23,543 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,544 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-12 00:18:23,546 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-12 00:18:23,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:23,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:23,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:23,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-10-12 00:18:23,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,570 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-12 00:18:23,572 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-12 00:18:23,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:23,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:23,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:23,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-10-12 00:18:23,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,599 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-12 00:18:23,601 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-12 00:18:23,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:23,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:23,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:23,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-10-12 00:18:23,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,626 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-12 00:18:23,627 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-12 00:18:23,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-10-12 00:18:23,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,653 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-12 00:18:23,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:23,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:23,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:23,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:23,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-10-12 00:18:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,679 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-12 00:18:23,681 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-12 00:18:23,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:23,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:23,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:23,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,705 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-10-12 00:18:23,706 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-12 00:18:23,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-10-12 00:18:23,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,738 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-10-12 00:18:23,739 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-12 00:18:23,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-10-12 00:18:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,768 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-10-12 00:18:23,771 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-12 00:18:23,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-10-12 00:18:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,801 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-10-12 00:18:23,803 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-12 00:18:23,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-10-12 00:18:23,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,834 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-10-12 00:18:23,836 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-12 00:18:23,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:23,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-10-12 00:18:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,866 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-10-12 00:18:23,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:23,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:23,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:23,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:23,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:23,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:23,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:23,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:23,891 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:18:23,891 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:18:23,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:23,893 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:23,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-10-12 00:18:23,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:23,906 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:23,906 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:23,906 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 20)_1 Supporting invariants [] [2024-10-12 00:18:23,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-10-12 00:18:23,965 INFO L156 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2024-10-12 00:18:23,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:23,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:23,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:24,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-10-12 00:18:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:24,318 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-12 00:18:24,318 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-12 00:18:24,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-12 00:18:24,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 49 states and 58 transitions. Complement of second has 5 states. [2024-10-12 00:18:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-12 00:18:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:24,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2024-10-12 00:18:24,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:24,355 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:24,675 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-12 00:18:24,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-12 00:18:24,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-12 00:18:24,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 49 states and 58 transitions. Complement of second has 5 states. [2024-10-12 00:18:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-12 00:18:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:24,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 39 letters. Loop has 2 letters. [2024-10-12 00:18:24,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:24,704 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:24,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:25,005 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-12 00:18:25,005 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-12 00:18:25,005 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-12 00:18:25,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 56 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 67 states and 83 transitions. Complement of second has 19 states. [2024-10-12 00:18:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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-12 00:18:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2024-10-12 00:18:25,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 39 letters. Loop has 2 letters. [2024-10-12 00:18:25,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:25,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 41 letters. Loop has 2 letters. [2024-10-12 00:18:25,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:25,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 39 letters. Loop has 4 letters. [2024-10-12 00:18:25,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:25,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 83 transitions. [2024-10-12 00:18:25,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:25,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 62 states and 76 transitions. [2024-10-12 00:18:25,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:25,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:25,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 76 transitions. [2024-10-12 00:18:25,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:25,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-12 00:18:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 76 transitions. [2024-10-12 00:18:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2024-10-12 00:18:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 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-12 00:18:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-10-12 00:18:25,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-12 00:18:25,170 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-12 00:18:25,170 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-12 00:18:25,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2024-10-12 00:18:25,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:25,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:25,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:25,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:25,171 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:25,171 INFO L745 eck$LassoCheckResult]: Stem: 4312#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4300#L561 assume !(main_~array_size~0#1 < 1); 4301#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 4302#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4303#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4304#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4305#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4308#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4322#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4321#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4320#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4319#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4318#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4317#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4316#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4315#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4314#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 4309#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4310#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4346#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4345#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4311#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4297#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4298#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4306#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4307#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4343#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4342#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4341#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4340#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4338#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4337#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4336#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4335#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4333#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4332#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4331#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4330#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4329#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4326#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4325#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4323#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4295#L552-3 [2024-10-12 00:18:25,171 INFO L747 eck$LassoCheckResult]: Loop: 4295#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4296#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 4295#L552-3 [2024-10-12 00:18:25,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1793463396, now seen corresponding path program 12 times [2024-10-12 00:18:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:25,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385145031] [2024-10-12 00:18:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 45 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:25,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385145031] [2024-10-12 00:18:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385145031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806262947] [2024-10-12 00:18:25,431 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:18:25,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:25,432 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:25,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2024-10-12 00:18:25,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-12 00:18:25,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:25,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 00:18:25,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:25,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806262947] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:25,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:25,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-10-12 00:18:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322417308] [2024-10-12 00:18:25,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:25,786 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:25,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 12 times [2024-10-12 00:18:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:25,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576154716] [2024-10-12 00:18:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:25,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:25,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 00:18:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2024-10-12 00:18:25,828 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 18 Second operand has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 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-12 00:18:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:25,950 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2024-10-12 00:18:25,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 103 transitions. [2024-10-12 00:18:25,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:25,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 56 states and 65 transitions. [2024-10-12 00:18:25,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:25,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:25,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2024-10-12 00:18:25,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:25,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-10-12 00:18:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2024-10-12 00:18:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-12 00:18:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 54 states have internal predecessors, (64), 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-12 00:18:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-10-12 00:18:25,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-12 00:18:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 00:18:25,956 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-12 00:18:25,956 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-12 00:18:25,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2024-10-12 00:18:25,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:25,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:25,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:25,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:25,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:25,957 INFO L745 eck$LassoCheckResult]: Stem: 4731#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4717#L561 assume !(main_~array_size~0#1 < 1); 4718#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 4719#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4720#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4721#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4722#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4728#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4750#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4749#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4748#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4747#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4746#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4745#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4744#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4743#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 4741#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 4740#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4735#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 4733#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4725#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4726#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4729#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4730#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4734#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4770#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4769#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4768#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4766#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4765#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4764#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4763#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4761#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4760#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4759#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4758#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4756#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4755#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4754#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4753#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4752#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4739#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 4738#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 4736#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 4723#L552-3 [2024-10-12 00:18:25,957 INFO L747 eck$LassoCheckResult]: Loop: 4723#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 4724#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 4723#L552-3 [2024-10-12 00:18:25,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1162190146, now seen corresponding path program 13 times [2024-10-12 00:18:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:25,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550455970] [2024-10-12 00:18:25,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:25,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:25,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:25,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 13 times [2024-10-12 00:18:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436901650] [2024-10-12 00:18:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:25,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:26,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:26,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 173234503, now seen corresponding path program 6 times [2024-10-12 00:18:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396087030] [2024-10-12 00:18:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:26,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:26,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:27,683 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:27,683 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:27,683 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:27,683 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:27,683 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:27,683 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:27,683 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:27,683 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:27,683 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration17_Lasso [2024-10-12 00:18:27,683 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:27,683 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:27,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:27,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:28,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:28,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:28,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:28,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:28,239 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:28,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-10-12 00:18:28,240 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-12 00:18:28,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:28,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:28,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:28,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:28,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:28,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:28,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:28,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-10-12 00:18:28,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:28,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:28,272 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:28,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-10-12 00:18:28,273 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-12 00:18:28,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:28,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:28,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:28,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:28,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:28,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:28,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:28,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-10-12 00:18:28,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:28,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:28,304 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:28,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-10-12 00:18:28,305 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-12 00:18:28,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:28,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:28,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:28,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:28,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:28,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:28,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:28,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:28,339 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:28,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-10-12 00:18:28,340 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-12 00:18:28,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:28,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:28,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:28,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:28,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:28,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:28,358 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:28,363 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-12 00:18:28,363 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:18:28,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:28,365 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:28,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-10-12 00:18:28,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:28,377 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:28,378 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:28,378 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 24)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 24)_1 Supporting invariants [] [2024-10-12 00:18:28,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-10-12 00:18:28,408 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2024-10-12 00:18:28,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-10-12 00:18:28,450 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:28,450 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:28,450 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:28,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:28,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 00:18:28,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:28,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:28,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:28,854 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-12 00:18:28,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2024-10-12 00:18:28,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-12 00:18:28,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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) Result 56 states and 66 transitions. Complement of second has 5 states. [2024-10-12 00:18:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-12 00:18:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:28,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2024-10-12 00:18:28,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:28,889 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:28,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:28,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 00:18:28,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:29,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:29,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:29,236 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-12 00:18:29,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2024-10-12 00:18:29,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-12 00:18:29,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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) Result 56 states and 66 transitions. Complement of second has 5 states. [2024-10-12 00:18:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-12 00:18:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:29,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 45 letters. Loop has 2 letters. [2024-10-12 00:18:29,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:29,267 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:29,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:29,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 00:18:29,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:29,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:29,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:29,691 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-12 00:18:29,691 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2024-10-12 00:18:29,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-12 00:18:29,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 64 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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) Result 75 states and 93 transitions. Complement of second has 21 states. [2024-10-12 00:18:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 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-12 00:18:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2024-10-12 00:18:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 45 letters. Loop has 2 letters. [2024-10-12 00:18:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 47 letters. Loop has 2 letters. [2024-10-12 00:18:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 45 letters. Loop has 4 letters. [2024-10-12 00:18:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:29,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2024-10-12 00:18:29,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:29,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 86 transitions. [2024-10-12 00:18:29,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:29,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:29,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 86 transitions. [2024-10-12 00:18:29,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:29,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-10-12 00:18:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 86 transitions. [2024-10-12 00:18:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2024-10-12 00:18:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 59 states have internal predecessors, (70), 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-12 00:18:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-10-12 00:18:29,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-10-12 00:18:29,911 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-10-12 00:18:29,911 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-12 00:18:29,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 70 transitions. [2024-10-12 00:18:29,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:29,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:29,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:29,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:29,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:29,912 INFO L745 eck$LassoCheckResult]: Stem: 5536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5537#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5524#L561 assume !(main_~array_size~0#1 < 1); 5525#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 5526#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5527#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5528#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5529#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5532#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5548#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5547#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5546#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5545#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5544#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5543#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5542#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5541#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 5540#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5539#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5538#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 5533#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5534#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5577#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5576#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5535#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5521#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5522#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5530#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5531#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5574#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5573#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5572#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5571#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5569#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5568#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5567#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5566#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5564#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5563#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5562#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5561#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5559#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5558#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5557#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5556#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5555#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5552#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 5551#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 5549#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 5519#L552-3 [2024-10-12 00:18:29,912 INFO L747 eck$LassoCheckResult]: Loop: 5519#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 5520#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 5519#L552-3 [2024-10-12 00:18:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1025367657, now seen corresponding path program 14 times [2024-10-12 00:18:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700641971] [2024-10-12 00:18:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:29,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:30,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700641971] [2024-10-12 00:18:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700641971] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133552942] [2024-10-12 00:18:30,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:18:30,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:30,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:30,267 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:30,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2024-10-12 00:18:30,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:18:30,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:30,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:18:30,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:30,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133552942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:30,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-10-12 00:18:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037615371] [2024-10-12 00:18:30,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:30,720 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 14 times [2024-10-12 00:18:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606588003] [2024-10-12 00:18:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:30,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:30,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:30,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 00:18:30,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2024-10-12 00:18:30,768 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. cyclomatic complexity: 20 Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 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-12 00:18:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:30,924 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-10-12 00:18:30,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 117 transitions. [2024-10-12 00:18:30,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:30,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 63 states and 73 transitions. [2024-10-12 00:18:30,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:30,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:30,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 73 transitions. [2024-10-12 00:18:30,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:30,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-10-12 00:18:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 73 transitions. [2024-10-12 00:18:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-10-12 00:18:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 61 states have internal predecessors, (72), 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-12 00:18:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-10-12 00:18:30,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-10-12 00:18:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 00:18:30,932 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-10-12 00:18:30,932 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-12 00:18:30,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 72 transitions. [2024-10-12 00:18:30,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:30,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:30,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:30,934 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:30,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:30,934 INFO L745 eck$LassoCheckResult]: Stem: 6013#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6014#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5999#L561 assume !(main_~array_size~0#1 < 1); 6000#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 6001#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6002#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6003#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6004#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6010#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6034#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6033#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6032#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6031#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6030#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6029#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6028#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6027#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6026#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6025#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6023#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6022#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6017#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 6015#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6007#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6008#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6011#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6012#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6016#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6059#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6058#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6057#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6055#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6054#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6053#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6052#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6050#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6049#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6048#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6047#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6045#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6044#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6043#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6042#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6040#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6039#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6038#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6037#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6036#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6021#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6020#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6018#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6005#L552-3 [2024-10-12 00:18:30,934 INFO L747 eck$LassoCheckResult]: Loop: 6005#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6006#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 6005#L552-3 [2024-10-12 00:18:30,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1227033589, now seen corresponding path program 15 times [2024-10-12 00:18:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:30,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119287681] [2024-10-12 00:18:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:30,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:30,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:30,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 15 times [2024-10-12 00:18:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381383263] [2024-10-12 00:18:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:30,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:30,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1936726214, now seen corresponding path program 7 times [2024-10-12 00:18:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630775802] [2024-10-12 00:18:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:31,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:31,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:33,733 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:33,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:33,733 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:33,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:33,733 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:33,733 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:33,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:33,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:33,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration19_Lasso [2024-10-12 00:18:33,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:33,733 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:33,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:33,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:34,531 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:34,531 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:34,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,534 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-10-12 00:18:34,536 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-12 00:18:34,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:34,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:34,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-10-12 00:18:34,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,563 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-10-12 00:18:34,564 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-12 00:18:34,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-10-12 00:18:34,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,590 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-10-12 00:18:34,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:34,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-10-12 00:18:34,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,615 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-10-12 00:18:34,616 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-12 00:18:34,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:34,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:34,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-10-12 00:18:34,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,645 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-10-12 00:18:34,647 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-12 00:18:34,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,661 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-10-12 00:18:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,676 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-10-12 00:18:34,677 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-12 00:18:34,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-10-12 00:18:34,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,702 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-10-12 00:18:34,703 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-12 00:18:34,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-10-12 00:18:34,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,728 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-10-12 00:18:34,729 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-12 00:18:34,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-10-12 00:18:34,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,758 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-10-12 00:18:34,759 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-12 00:18:34,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-10-12 00:18:34,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,786 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-10-12 00:18:34,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-12 00:18:34,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-10-12 00:18:34,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,811 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-10-12 00:18:34,812 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-12 00:18:34,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:34,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:34,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-10-12 00:18:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,842 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-10-12 00:18:34,843 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-12 00:18:34,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-10-12 00:18:34,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,867 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-10-12 00:18:34,869 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-12 00:18:34,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:34,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,894 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-10-12 00:18:34,895 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-12 00:18:34,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:34,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:34,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:34,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-10-12 00:18:34,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,919 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-10-12 00:18:34,920 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-12 00:18:34,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:34,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:34,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:34,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-10-12 00:18:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,952 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-10-12 00:18:34,953 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-12 00:18:34,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:34,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:34,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:34,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:34,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:34,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:34,973 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:34,983 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-12 00:18:34,983 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-12 00:18:34,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:34,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:34,985 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:34,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-10-12 00:18:34,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:34,998 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:34,998 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:34,998 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1 Supporting invariants [] [2024-10-12 00:18:35,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-10-12 00:18:35,029 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2024-10-12 00:18:35,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:35,033 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:35,033 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:35,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:18:35,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:35,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:35,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:35,335 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-12 00:18:35,336 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-12 00:18:35,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:35,368 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 74 transitions. Complement of second has 5 states. [2024-10-12 00:18:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:35,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2024-10-12 00:18:35,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:35,369 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:35,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:35,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:18:35,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:35,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:35,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:35,654 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-12 00:18:35,654 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-12 00:18:35,654 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:35,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 74 transitions. Complement of second has 5 states. [2024-10-12 00:18:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:35,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 51 letters. Loop has 2 letters. [2024-10-12 00:18:35,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:35,686 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:35,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:35,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:18:35,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:35,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:35,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:35,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:36,009 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-12 00:18:36,010 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-12 00:18:36,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20 Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:36,214 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 72 transitions. cyclomatic complexity: 20. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 83 states and 103 transitions. Complement of second has 23 states. [2024-10-12 00:18:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2024-10-12 00:18:36,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 51 letters. Loop has 2 letters. [2024-10-12 00:18:36,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:36,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 53 letters. Loop has 2 letters. [2024-10-12 00:18:36,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:36,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 65 transitions. Stem has 51 letters. Loop has 4 letters. [2024-10-12 00:18:36,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:36,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 103 transitions. [2024-10-12 00:18:36,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:36,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 78 states and 96 transitions. [2024-10-12 00:18:36,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:36,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:36,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 96 transitions. [2024-10-12 00:18:36,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:36,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-10-12 00:18:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 96 transitions. [2024-10-12 00:18:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-10-12 00:18:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 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-12 00:18:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2024-10-12 00:18:36,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-10-12 00:18:36,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-10-12 00:18:36,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-12 00:18:36,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 78 transitions. [2024-10-12 00:18:36,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:36,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:36,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:36,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:36,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:36,223 INFO L745 eck$LassoCheckResult]: Stem: 6907#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6908#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6900#L561 assume !(main_~array_size~0#1 < 1); 6901#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 6891#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6892#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6893#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6894#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6922#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6921#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6920#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6919#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6918#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6917#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6916#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6915#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6914#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6913#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6912#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 6911#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 6910#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6909#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 6904#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6905#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6956#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6955#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6906#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6897#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6898#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6902#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6903#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6953#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6952#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6951#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6950#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6948#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6947#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6946#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6945#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6943#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6942#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6941#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6940#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6938#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6937#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6936#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6935#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6933#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6932#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6931#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6930#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6929#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6926#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 6925#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 6923#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 6895#L552-3 [2024-10-12 00:18:36,223 INFO L747 eck$LassoCheckResult]: Loop: 6895#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 6896#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 6895#L552-3 [2024-10-12 00:18:36,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:36,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1473052982, now seen corresponding path program 16 times [2024-10-12 00:18:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821532058] [2024-10-12 00:18:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 91 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821532058] [2024-10-12 00:18:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821532058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146884343] [2024-10-12 00:18:36,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:18:36,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:36,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:36,584 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:36,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2024-10-12 00:18:36,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:18:36,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:36,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 00:18:36,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:36,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 120 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146884343] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:37,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-10-12 00:18:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523014088] [2024-10-12 00:18:37,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:37,152 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:37,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 16 times [2024-10-12 00:18:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609949480] [2024-10-12 00:18:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:37,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-12 00:18:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2024-10-12 00:18:37,200 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. cyclomatic complexity: 22 Second operand has 32 states, 31 states have (on average 3.129032258064516) internal successors, (97), 32 states have internal predecessors, (97), 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-12 00:18:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:37,391 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2024-10-12 00:18:37,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 131 transitions. [2024-10-12 00:18:37,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:37,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 70 states and 81 transitions. [2024-10-12 00:18:37,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:37,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:37,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2024-10-12 00:18:37,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:37,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-10-12 00:18:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2024-10-12 00:18:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-12 00:18:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 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-12 00:18:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-10-12 00:18:37,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-12 00:18:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 00:18:37,398 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-12 00:18:37,398 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-12 00:18:37,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2024-10-12 00:18:37,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:37,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:37,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:37,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:37,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:37,399 INFO L745 eck$LassoCheckResult]: Stem: 7445#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 7434#L561 assume !(main_~array_size~0#1 < 1); 7435#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 7436#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7437#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7438#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7439#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7440#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7466#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7465#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7464#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7463#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7462#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7461#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7460#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7459#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7458#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7457#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7456#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7455#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 7453#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 7452#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7447#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 7443#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7431#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7432#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7441#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7442#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7444#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7496#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7495#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7494#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7492#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7491#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7490#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7489#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7487#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7486#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7485#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7484#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7482#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7481#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7480#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7479#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7477#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7476#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7475#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7474#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7472#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7471#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7470#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7469#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7468#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7451#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 7450#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 7448#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 7429#L552-3 [2024-10-12 00:18:37,400 INFO L747 eck$LassoCheckResult]: Loop: 7429#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 7430#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 7429#L552-3 [2024-10-12 00:18:37,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1562782376, now seen corresponding path program 17 times [2024-10-12 00:18:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917649674] [2024-10-12 00:18:37,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 17 times [2024-10-12 00:18:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921765142] [2024-10-12 00:18:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1404689107, now seen corresponding path program 8 times [2024-10-12 00:18:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482622795] [2024-10-12 00:18:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:37,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:41,047 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:41,048 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:41,048 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:41,048 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:41,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:41,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:41,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:41,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration21_Lasso [2024-10-12 00:18:41,048 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:41,048 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:41,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:41,844 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:41,845 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,846 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:41,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-10-12 00:18:41,847 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-12 00:18:41,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:41,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:41,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:41,861 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2024-10-12 00:18:41,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,874 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:41,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-10-12 00:18:41,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:41,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:41,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-10-12 00:18:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,901 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:41,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-10-12 00:18:41,903 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-12 00:18:41,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:41,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:41,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:41,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-10-12 00:18:41,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,929 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:41,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-10-12 00:18:41,930 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-12 00:18:41,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:41,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:41,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:41,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-10-12 00:18:41,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,957 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:41,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-10-12 00:18:41,958 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-12 00:18:41,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:41,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:41,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:41,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-10-12 00:18:41,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:41,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:41,986 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:41,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-10-12 00:18:41,988 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-12 00:18:41,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:41,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:41,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:41,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:41,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:41,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:41,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:41,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:42,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,012 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-10-12 00:18:42,013 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-12 00:18:42,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-10-12 00:18:42,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,046 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-10-12 00:18:42,047 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-12 00:18:42,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-10-12 00:18:42,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,074 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-10-12 00:18:42,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:42,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-10-12 00:18:42,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,107 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-10-12 00:18:42,108 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-12 00:18:42,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-10-12 00:18:42,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,143 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-10-12 00:18:42,145 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-12 00:18:42,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-10-12 00:18:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,176 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-10-12 00:18:42,177 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-12 00:18:42,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-10-12 00:18:42,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,211 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-10-12 00:18:42,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:42,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-10-12 00:18:42,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,260 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-10-12 00:18:42,262 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-12 00:18:42,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-10-12 00:18:42,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,294 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-10-12 00:18:42,297 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-12 00:18:42,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-10-12 00:18:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,327 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-10-12 00:18:42,328 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-12 00:18:42,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:42,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2024-10-12 00:18:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,357 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-10-12 00:18:42,359 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-12 00:18:42,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:42,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:42,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:42,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:42,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:42,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:42,378 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:42,387 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:18:42,388 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:18:42,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:42,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:42,391 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:42,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-10-12 00:18:42,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:42,407 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:42,407 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:42,407 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2024-10-12 00:18:42,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:42,439 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2024-10-12 00:18:42,442 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:42,442 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:42,442 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:42,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:42,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:18:42,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:42,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:42,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:42,766 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-12 00:18:42,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2024-10-12 00:18:42,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:42,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 82 transitions. Complement of second has 5 states. [2024-10-12 00:18:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:42,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 57 letters. Loop has 2 letters. [2024-10-12 00:18:42,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:42,801 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:42,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:18:42,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:43,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:43,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:43,131 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-12 00:18:43,131 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2024-10-12 00:18:43,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:43,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 82 transitions. Complement of second has 5 states. [2024-10-12 00:18:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:43,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 57 letters. Loop has 2 letters. [2024-10-12 00:18:43,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,164 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:43,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:43,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:18:43,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:43,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:43,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:43,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-10-12 00:18:43,499 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-12 00:18:43,500 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2024-10-12 00:18:43,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22 Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:43,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 22. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 113 transitions. Complement of second has 25 states. [2024-10-12 00:18:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2024-10-12 00:18:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 57 letters. Loop has 2 letters. [2024-10-12 00:18:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 59 letters. Loop has 2 letters. [2024-10-12 00:18:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 57 letters. Loop has 4 letters. [2024-10-12 00:18:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:43,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 113 transitions. [2024-10-12 00:18:43,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:43,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 86 states and 106 transitions. [2024-10-12 00:18:43,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:43,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:43,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 106 transitions. [2024-10-12 00:18:43,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:43,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 106 transitions. [2024-10-12 00:18:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 106 transitions. [2024-10-12 00:18:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2024-10-12 00:18:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 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-12 00:18:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-10-12 00:18:43,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-12 00:18:43,736 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-12 00:18:43,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-12 00:18:43,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-10-12 00:18:43,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:43,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:43,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:43,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:43,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:43,737 INFO L745 eck$LassoCheckResult]: Stem: 8431#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 8419#L561 assume !(main_~array_size~0#1 < 1); 8420#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 8421#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8422#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8423#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8424#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8427#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8447#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8446#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8445#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8444#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8443#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8442#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8441#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8440#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8439#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8438#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8437#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8436#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 8435#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 8434#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 8433#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 8428#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8429#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8486#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8485#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8430#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8416#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8417#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8425#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8426#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8483#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8482#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8481#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8480#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8478#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8477#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8476#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8475#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8473#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8472#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8471#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8470#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8468#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8467#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8466#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8465#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8463#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8462#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8461#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8460#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8458#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8457#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8456#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8455#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8454#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8451#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 8450#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 8448#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 8414#L552-3 [2024-10-12 00:18:43,737 INFO L747 eck$LassoCheckResult]: Loop: 8414#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 8415#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 8414#L552-3 [2024-10-12 00:18:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1286501379, now seen corresponding path program 18 times [2024-10-12 00:18:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670808974] [2024-10-12 00:18:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 120 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670808974] [2024-10-12 00:18:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670808974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777232233] [2024-10-12 00:18:44,099 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:18:44,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:44,103 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:44,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2024-10-12 00:18:44,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-10-12 00:18:44,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:44,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 00:18:44,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:44,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 153 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777232233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:44,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:44,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-10-12 00:18:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239069638] [2024-10-12 00:18:44,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:44,805 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 18 times [2024-10-12 00:18:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115871333] [2024-10-12 00:18:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:44,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:44,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:44,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:44,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 00:18:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 00:18:44,855 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 24 Second operand has 35 states, 34 states have (on average 3.1470588235294117) internal successors, (107), 35 states have internal predecessors, (107), 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-12 00:18:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:45,047 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2024-10-12 00:18:45,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 145 transitions. [2024-10-12 00:18:45,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:45,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 77 states and 89 transitions. [2024-10-12 00:18:45,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:45,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:45,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 89 transitions. [2024-10-12 00:18:45,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:45,048 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 89 transitions. [2024-10-12 00:18:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 89 transitions. [2024-10-12 00:18:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-12 00:18:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 75 states have internal predecessors, (88), 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-12 00:18:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-10-12 00:18:45,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-10-12 00:18:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 00:18:45,052 INFO L425 stractBuchiCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-10-12 00:18:45,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-12 00:18:45,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 88 transitions. [2024-10-12 00:18:45,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:45,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:45,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:45,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:45,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:45,054 INFO L745 eck$LassoCheckResult]: Stem: 9025#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9026#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9015#L561 assume !(main_~array_size~0#1 < 1); 9016#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 9017#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9018#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9019#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9020#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9049#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9048#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9047#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9046#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9045#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9044#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9043#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9042#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9041#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9040#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9039#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9038#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9037#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9036#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9035#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 9033#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 9032#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 9027#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 9023#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9012#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9013#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9021#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9022#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9024#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9084#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9083#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9082#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9080#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9079#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9078#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9077#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9075#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9074#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9073#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9072#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9070#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9069#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9068#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9067#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9065#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9064#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9063#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9062#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9060#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9059#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9058#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9057#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9055#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9054#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9053#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9052#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9051#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9031#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 9030#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 9028#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 9010#L552-3 [2024-10-12 00:18:45,054 INFO L747 eck$LassoCheckResult]: Loop: 9010#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 9011#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 9010#L552-3 [2024-10-12 00:18:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 832559451, now seen corresponding path program 19 times [2024-10-12 00:18:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994763210] [2024-10-12 00:18:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:45,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:45,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 19 times [2024-10-12 00:18:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:45,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624909961] [2024-10-12 00:18:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1225716512, now seen corresponding path program 9 times [2024-10-12 00:18:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385700559] [2024-10-12 00:18:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:45,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:50,335 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:50,335 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:50,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:50,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:50,335 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:50,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:50,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:50,336 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:50,336 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration23_Lasso [2024-10-12 00:18:50,336 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:50,336 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:50,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:50,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:51,310 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:51,310 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:51,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,312 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-10-12 00:18:51,314 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-12 00:18:51,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-10-12 00:18:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,341 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-10-12 00:18:51,342 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-12 00:18:51,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-10-12 00:18:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,371 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-10-12 00:18:51,372 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-12 00:18:51,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-10-12 00:18:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,396 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-10-12 00:18:51,398 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-12 00:18:51,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2024-10-12 00:18:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,425 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-10-12 00:18:51,427 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-12 00:18:51,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,440 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-10-12 00:18:51,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,452 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-10-12 00:18:51,454 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-12 00:18:51,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-10-12 00:18:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,484 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-10-12 00:18:51,485 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-12 00:18:51,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2024-10-12 00:18:51,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,513 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-10-12 00:18:51,514 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-12 00:18:51,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:51,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,539 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-10-12 00:18:51,541 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-12 00:18:51,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,554 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-10-12 00:18:51,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,567 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-10-12 00:18:51,568 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-12 00:18:51,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-10-12 00:18:51,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,595 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-10-12 00:18:51,596 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-12 00:18:51,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-10-12 00:18:51,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,626 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-10-12 00:18:51,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:51,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-10-12 00:18:51,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,659 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-10-12 00:18:51,661 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-12 00:18:51,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-10-12 00:18:51,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,688 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-10-12 00:18:51,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:51,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2024-10-12 00:18:51,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,716 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-10-12 00:18:51,717 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-12 00:18:51,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:51,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:51,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:51,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2024-10-12 00:18:51,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,744 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-10-12 00:18:51,747 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-12 00:18:51,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2024-10-12 00:18:51,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,780 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-10-12 00:18:51,781 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-12 00:18:51,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-10-12 00:18:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,813 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-10-12 00:18:51,815 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-12 00:18:51,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-10-12 00:18:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,844 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-10-12 00:18:51,845 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-12 00:18:51,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2024-10-12 00:18:51,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,879 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-10-12 00:18:51,880 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-12 00:18:51,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2024-10-12 00:18:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,909 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2024-10-12 00:18:51,910 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-12 00:18:51,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2024-10-12 00:18:51,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,943 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-10-12 00:18:51,944 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-12 00:18:51,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:51,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2024-10-12 00:18:51,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:51,972 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:51,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-10-12 00:18:51,974 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-12 00:18:51,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:51,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:51,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:51,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:51,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:51,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:51,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:52,003 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:18:52,003 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:18:52,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:52,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:52,006 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:18:52,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-10-12 00:18:52,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:52,018 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:18:52,018 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:52,018 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 36))_1 Supporting invariants [] [2024-10-12 00:18:52,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2024-10-12 00:18:52,055 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-10-12 00:18:52,057 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:18:52,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:18:52,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:18:52,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:52,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:18:52,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:52,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:52,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:52,404 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-12 00:18:52,405 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-12 00:18:52,405 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-12 00:18:52,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 77 states and 90 transitions. Complement of second has 5 states. [2024-10-12 00:18:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-12 00:18:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:52,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 63 letters. Loop has 2 letters. [2024-10-12 00:18:52,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:52,462 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:52,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:52,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:18:52,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:52,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:52,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:52,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:52,908 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-12 00:18:52,908 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-12 00:18:52,908 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-12 00:18:52,937 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 77 states and 90 transitions. Complement of second has 5 states. [2024-10-12 00:18:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-12 00:18:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:18:52,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 63 letters. Loop has 2 letters. [2024-10-12 00:18:52,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:52,941 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:52,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:18:52,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:53,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:18:53,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:53,281 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-12 00:18:53,282 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-12 00:18:53,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24 Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-12 00:18:53,532 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 88 transitions. cyclomatic complexity: 24. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 99 states and 123 transitions. Complement of second has 27 states. [2024-10-12 00:18:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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-12 00:18:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 77 transitions. [2024-10-12 00:18:53,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 63 letters. Loop has 2 letters. [2024-10-12 00:18:53,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:53,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 65 letters. Loop has 2 letters. [2024-10-12 00:18:53,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:53,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 77 transitions. Stem has 63 letters. Loop has 4 letters. [2024-10-12 00:18:53,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:53,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 123 transitions. [2024-10-12 00:18:53,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:53,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 94 states and 116 transitions. [2024-10-12 00:18:53,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:18:53,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:18:53,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 116 transitions. [2024-10-12 00:18:53,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:53,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 116 transitions. [2024-10-12 00:18:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 116 transitions. [2024-10-12 00:18:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2024-10-12 00:18:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 80 states have internal predecessors, (94), 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-12 00:18:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-10-12 00:18:53,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-10-12 00:18:53,536 INFO L425 stractBuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-10-12 00:18:53,536 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-12 00:18:53,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 94 transitions. [2024-10-12 00:18:53,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:53,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:53,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:53,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:53,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:53,537 INFO L745 eck$LassoCheckResult]: Stem: 10105#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10093#L561 assume !(main_~array_size~0#1 < 1); 10094#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 10095#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10096#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10097#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10098#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10101#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10123#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10122#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10121#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10120#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10119#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10118#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10117#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10116#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10115#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10114#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10113#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10112#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10111#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10110#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10109#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10108#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 10107#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 10102#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10103#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10167#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10166#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10104#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10090#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10091#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10099#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10100#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10164#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10163#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10162#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10161#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10159#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10158#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10157#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10156#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10154#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10153#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10152#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10151#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10149#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10148#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10147#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10146#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10144#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10143#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10142#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10141#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10139#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10138#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10137#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10136#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10134#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10133#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10132#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10131#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10130#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10127#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10126#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10124#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10088#L552-3 [2024-10-12 00:18:53,538 INFO L747 eck$LassoCheckResult]: Loop: 10088#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10089#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 10088#L552-3 [2024-10-12 00:18:53,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1092528432, now seen corresponding path program 20 times [2024-10-12 00:18:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932697718] [2024-10-12 00:18:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 153 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:18:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932697718] [2024-10-12 00:18:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932697718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:18:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593800539] [2024-10-12 00:18:53,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:18:53,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:18:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:53,904 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:18:53,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Waiting until timeout for monitored process [2024-10-12 00:18:54,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:18:54,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:18:54,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:18:54,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:54,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:18:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 190 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593800539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:18:54,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:18:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-10-12 00:18:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003819519] [2024-10-12 00:18:54,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:18:54,514 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:18:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 20 times [2024-10-12 00:18:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558039967] [2024-10-12 00:18:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:54,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:18:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-12 00:18:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2024-10-12 00:18:54,577 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. cyclomatic complexity: 26 Second operand has 38 states, 37 states have (on average 3.1621621621621623) internal successors, (117), 38 states have internal predecessors, (117), 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-12 00:18:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:18:54,794 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2024-10-12 00:18:54,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 159 transitions. [2024-10-12 00:18:54,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:54,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 84 states and 97 transitions. [2024-10-12 00:18:54,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:18:54,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:54,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 97 transitions. [2024-10-12 00:18:54,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:54,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 97 transitions. [2024-10-12 00:18:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 97 transitions. [2024-10-12 00:18:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-12 00:18:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 82 states have internal predecessors, (96), 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-12 00:18:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2024-10-12 00:18:54,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-10-12 00:18:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-12 00:18:54,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-10-12 00:18:54,798 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-12 00:18:54,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 96 transitions. [2024-10-12 00:18:54,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:18:54,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:54,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:54,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:54,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:18:54,799 INFO L745 eck$LassoCheckResult]: Stem: 10758#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10759#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 10751#L561 assume !(main_~array_size~0#1 < 1); 10752#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 10742#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10743#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10744#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10745#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10753#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10783#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10782#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10781#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10780#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10779#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10778#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10777#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10776#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10775#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10774#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10773#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10772#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10771#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10770#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10769#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10768#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 10765#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 10764#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 10760#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 10756#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10748#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10749#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10754#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10755#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10757#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10823#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10822#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10821#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10819#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10818#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10817#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10816#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10814#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10813#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10812#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10811#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10809#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10808#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10807#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10806#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10804#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10803#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10802#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10801#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10799#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10798#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10797#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10796#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10794#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10793#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10792#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10791#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10789#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10788#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10787#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10786#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10785#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10766#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 10763#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 10761#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 10746#L552-3 [2024-10-12 00:18:54,799 INFO L747 eck$LassoCheckResult]: Loop: 10746#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 10747#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 10746#L552-3 [2024-10-12 00:18:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -112658418, now seen corresponding path program 21 times [2024-10-12 00:18:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886043774] [2024-10-12 00:18:54,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:54,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 21 times [2024-10-12 00:18:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219237359] [2024-10-12 00:18:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:54,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash -890556141, now seen corresponding path program 10 times [2024-10-12 00:18:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475764839] [2024-10-12 00:18:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:54,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:05,183 WARN L286 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 356 DAG size of output: 266 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:19:05,414 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:05,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:05,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:05,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:05,414 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:05,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:05,415 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:05,415 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:05,415 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration25_Lasso [2024-10-12 00:19:05,415 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:05,415 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:05,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:05,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:06,309 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:06,310 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,311 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2024-10-12 00:19:06,315 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-12 00:19:06,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:06,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:06,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:06,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2024-10-12 00:19:06,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,340 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2024-10-12 00:19:06,342 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-12 00:19:06,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:06,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,367 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2024-10-12 00:19:06,369 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-12 00:19:06,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:06,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:06,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:06,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2024-10-12 00:19:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,392 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2024-10-12 00:19:06,394 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-12 00:19:06,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:06,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:06,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:06,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2024-10-12 00:19:06,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,417 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2024-10-12 00:19:06,419 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-12 00:19:06,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:06,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:06,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:06,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2024-10-12 00:19:06,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,445 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2024-10-12 00:19:06,446 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-12 00:19:06,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:06,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:06,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:06,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2024-10-12 00:19:06,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,472 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2024-10-12 00:19:06,473 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-12 00:19:06,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,491 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2024-10-12 00:19:06,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,503 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2024-10-12 00:19:06,505 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-12 00:19:06,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2024-10-12 00:19:06,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,534 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2024-10-12 00:19:06,535 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-12 00:19:06,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2024-10-12 00:19:06,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,566 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2024-10-12 00:19:06,568 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-12 00:19:06,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2024-10-12 00:19:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,598 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2024-10-12 00:19:06,600 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-12 00:19:06,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2024-10-12 00:19:06,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,632 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2024-10-12 00:19:06,634 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-12 00:19:06,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:06,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2024-10-12 00:19:06,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,668 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2024-10-12 00:19:06,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-12 00:19:06,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:06,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:06,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:06,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:06,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:06,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:06,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:06,691 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-12 00:19:06,691 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:19:06,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:06,693 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:06,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2024-10-12 00:19:06,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:06,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:19:06,704 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:06,705 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 40)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) 40)_1 Supporting invariants [] [2024-10-12 00:19:06,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2024-10-12 00:19:06,741 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2024-10-12 00:19:06,744 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:19:06,744 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:19:06,744 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:19:06,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:06,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:19:06,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:07,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:07,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:19:07,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:07,294 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-12 00:19:07,294 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-12 00:19:07,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 00:19:07,328 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 84 states and 98 transitions. Complement of second has 5 states. [2024-10-12 00:19:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 00:19:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:19:07,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 69 letters. Loop has 2 letters. [2024-10-12 00:19:07,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:07,329 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:07,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:07,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:19:07,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:07,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:19:07,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:07,839 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-12 00:19:07,840 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-12 00:19:07,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 00:19:07,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 84 states and 98 transitions. Complement of second has 5 states. [2024-10-12 00:19:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 00:19:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:19:07,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 69 letters. Loop has 2 letters. [2024-10-12 00:19:07,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:07,878 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:07,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:07,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:19:07,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:08,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:19:08,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:08,403 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-12 00:19:08,403 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-12 00:19:08,404 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26 Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 00:19:08,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 96 transitions. cyclomatic complexity: 26. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 107 states and 133 transitions. Complement of second has 29 states. [2024-10-12 00:19:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:19:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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-12 00:19:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2024-10-12 00:19:08,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 83 transitions. Stem has 69 letters. Loop has 2 letters. [2024-10-12 00:19:08,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:08,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 83 transitions. Stem has 71 letters. Loop has 2 letters. [2024-10-12 00:19:08,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:08,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 83 transitions. Stem has 69 letters. Loop has 4 letters. [2024-10-12 00:19:08,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:08,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 133 transitions. [2024-10-12 00:19:08,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:08,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 102 states and 126 transitions. [2024-10-12 00:19:08,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:19:08,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:19:08,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 126 transitions. [2024-10-12 00:19:08,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:08,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-10-12 00:19:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 126 transitions. [2024-10-12 00:19:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2024-10-12 00:19:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 87 states have internal predecessors, (102), 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-12 00:19:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-10-12 00:19:08,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-10-12 00:19:08,699 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-10-12 00:19:08,699 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-12 00:19:08,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 102 transitions. [2024-10-12 00:19:08,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:08,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:08,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:08,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:08,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:19:08,700 INFO L745 eck$LassoCheckResult]: Stem: 11932#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11925#L561 assume !(main_~array_size~0#1 < 1); 11926#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 11916#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11917#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11918#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11919#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11953#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11952#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11951#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11950#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11949#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11948#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11947#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11946#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11945#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11944#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11943#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11942#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11941#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11940#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11939#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11938#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11937#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 11936#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 11935#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 11934#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 11929#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11930#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12002#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12001#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11931#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11922#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11923#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11927#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11928#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11999#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11998#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11997#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11996#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11994#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11993#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11992#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11991#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11989#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11988#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11987#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11986#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11984#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11983#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11982#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11981#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11979#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11978#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11977#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11976#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11974#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11973#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11972#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11971#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11969#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11968#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11967#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11966#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11964#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11963#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11962#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11961#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11960#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11957#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 11956#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 11954#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 11920#L552-3 [2024-10-12 00:19:08,700 INFO L747 eck$LassoCheckResult]: Loop: 11920#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 11921#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 11920#L552-3 [2024-10-12 00:19:08,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1125960093, now seen corresponding path program 22 times [2024-10-12 00:19:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267296494] [2024-10-12 00:19:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 190 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:09,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267296494] [2024-10-12 00:19:09,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267296494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693208579] [2024-10-12 00:19:09,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:19:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:09,150 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:09,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (218)] Waiting until timeout for monitored process [2024-10-12 00:19:09,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:19:09,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:19:09,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 00:19:09,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 231 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:09,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 231 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:09,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693208579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:09,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-10-12 00:19:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606580011] [2024-10-12 00:19:09,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:09,899 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:19:09,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 22 times [2024-10-12 00:19:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323493191] [2024-10-12 00:19:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:09,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:09,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 00:19:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 00:19:09,951 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. cyclomatic complexity: 28 Second operand has 41 states, 40 states have (on average 3.175) internal successors, (127), 41 states have internal predecessors, (127), 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-12 00:19:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:10,277 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2024-10-12 00:19:10,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 173 transitions. [2024-10-12 00:19:10,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:10,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 91 states and 105 transitions. [2024-10-12 00:19:10,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:19:10,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:19:10,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2024-10-12 00:19:10,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:10,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-10-12 00:19:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2024-10-12 00:19:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-12 00:19:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 89 states have internal predecessors, (104), 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-12 00:19:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2024-10-12 00:19:10,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-10-12 00:19:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 00:19:10,283 INFO L425 stractBuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2024-10-12 00:19:10,283 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-12 00:19:10,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2024-10-12 00:19:10,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:10,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:10,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:10,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:10,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:19:10,285 INFO L745 eck$LassoCheckResult]: Stem: 12643#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 12633#L561 assume !(main_~array_size~0#1 < 1); 12634#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 12635#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12636#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12637#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12638#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12671#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12670#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12669#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12668#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12667#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12666#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12665#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12664#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12663#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12662#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12661#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12660#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12659#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12658#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12657#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12656#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12655#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12654#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12653#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 12651#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 12650#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 12645#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 12641#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12630#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12631#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12639#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12640#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12642#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12716#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12715#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12714#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12712#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12711#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12710#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12709#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12707#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12706#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12705#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12704#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12702#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12701#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12700#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12699#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12697#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12696#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12695#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12694#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12692#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12691#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12690#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12689#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12687#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12686#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12685#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12684#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12682#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12681#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12680#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12679#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12677#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12676#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12675#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12674#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12673#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12649#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 12648#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 12646#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 12628#L552-3 [2024-10-12 00:19:10,286 INFO L747 eck$LassoCheckResult]: Loop: 12628#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 12629#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 12628#L552-3 [2024-10-12 00:19:10,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash 859989697, now seen corresponding path program 23 times [2024-10-12 00:19:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638169780] [2024-10-12 00:19:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:10,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 23 times [2024-10-12 00:19:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826104193] [2024-10-12 00:19:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:10,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1816379142, now seen corresponding path program 11 times [2024-10-12 00:19:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756315360] [2024-10-12 00:19:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:10,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:21,338 WARN L286 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 384 DAG size of output: 286 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:19:22,032 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:19:22,033 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:19:22,033 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:19:22,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:19:22,033 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:19:22,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:22,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:19:22,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:19:22,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration27_Lasso [2024-10-12 00:19:22,033 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:19:22,033 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:19:22,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:22,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:19:23,234 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:19:23,235 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:19:23,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,237 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2024-10-12 00:19:23,239 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-12 00:19:23,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:23,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:23,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:23,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Ended with exit code 0 [2024-10-12 00:19:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,276 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2024-10-12 00:19:23,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:19:23,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:23,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:23,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:23,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2024-10-12 00:19:23,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,314 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,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-12 00:19:23,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2024-10-12 00:19:23,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:23,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:23,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:23,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:23,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,359 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2024-10-12 00:19:23,361 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-12 00:19:23,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:19:23,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:19:23,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:19:23,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,389 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2024-10-12 00:19:23,392 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-12 00:19:23,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:23,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,421 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2024-10-12 00:19:23,423 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-12 00:19:23,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:23,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,452 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2024-10-12 00:19:23,453 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-12 00:19:23,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2024-10-12 00:19:23,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,485 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2024-10-12 00:19:23,486 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-12 00:19:23,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2024-10-12 00:19:23,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,516 INFO L229 MonitoredProcess]: Starting monitored process 227 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2024-10-12 00:19:23,519 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-12 00:19:23,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2024-10-12 00:19:23,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,548 INFO L229 MonitoredProcess]: Starting monitored process 228 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2024-10-12 00:19:23,550 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-12 00:19:23,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2024-10-12 00:19:23,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,579 INFO L229 MonitoredProcess]: Starting monitored process 229 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2024-10-12 00:19:23,581 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-12 00:19:23,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2024-10-12 00:19:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,612 INFO L229 MonitoredProcess]: Starting monitored process 230 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2024-10-12 00:19:23,613 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-12 00:19:23,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2024-10-12 00:19:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,646 INFO L229 MonitoredProcess]: Starting monitored process 231 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2024-10-12 00:19:23,647 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-12 00:19:23,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2024-10-12 00:19:23,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,677 INFO L229 MonitoredProcess]: Starting monitored process 232 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2024-10-12 00:19:23,679 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-12 00:19:23,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2024-10-12 00:19:23,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,713 INFO L229 MonitoredProcess]: Starting monitored process 233 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2024-10-12 00:19:23,715 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-12 00:19:23,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2024-10-12 00:19:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,743 INFO L229 MonitoredProcess]: Starting monitored process 234 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2024-10-12 00:19:23,744 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-12 00:19:23,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Ended with exit code 0 [2024-10-12 00:19:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,775 INFO L229 MonitoredProcess]: Starting monitored process 235 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2024-10-12 00:19:23,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:19:23,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2024-10-12 00:19:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,805 INFO L229 MonitoredProcess]: Starting monitored process 236 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2024-10-12 00:19:23,806 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-12 00:19:23,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2024-10-12 00:19:23,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,834 INFO L229 MonitoredProcess]: Starting monitored process 237 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2024-10-12 00:19:23,836 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-12 00:19:23,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:19:23,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Ended with exit code 0 [2024-10-12 00:19:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,865 INFO L229 MonitoredProcess]: Starting monitored process 238 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2024-10-12 00:19:23,866 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-12 00:19:23,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:19:23,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:19:23,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:19:23,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:19:23,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:19:23,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:19:23,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:19:23,888 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-12 00:19:23,888 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-12 00:19:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:19:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:23,890 INFO L229 MonitoredProcess]: Starting monitored process 239 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:19:23,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2024-10-12 00:19:23,891 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:19:23,903 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:19:23,903 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:19:23,903 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 44))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc8#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 44))_1 Supporting invariants [] [2024-10-12 00:19:23,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2024-10-12 00:19:23,941 INFO L156 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2024-10-12 00:19:23,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:19:23,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:19:23,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc8!base,]]] [2024-10-12 00:19:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:24,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 00:19:24,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:24,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2024-10-12 00:19:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:24,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:19:24,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:24,438 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-12 00:19:24,439 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2024-10-12 00:19:24,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:24,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 106 transitions. Complement of second has 5 states. [2024-10-12 00:19:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:19:24,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 75 letters. Loop has 2 letters. [2024-10-12 00:19:24,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:24,484 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:24,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 00:19:24,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:24,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:19:24,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:24,936 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-12 00:19:24,937 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.14 stem predicates 2 loop predicates [2024-10-12 00:19:24,937 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:24,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 91 states and 106 transitions. Complement of second has 5 states. [2024-10-12 00:19:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:19:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-12 00:19:24,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 75 letters. Loop has 2 letters. [2024-10-12 00:19:24,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:24,980 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:19:24,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:25,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 00:19:25,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:25,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:19:25,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:25,407 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-12 00:19:25,407 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.14 stem predicates 2 loop predicates [2024-10-12 00:19:25,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28 Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:25,737 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 104 transitions. cyclomatic complexity: 28. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 115 states and 143 transitions. Complement of second has 31 states. [2024-10-12 00:19:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 14 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-12 00:19:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:19:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2024-10-12 00:19:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 89 transitions. Stem has 75 letters. Loop has 2 letters. [2024-10-12 00:19:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 89 transitions. Stem has 77 letters. Loop has 2 letters. [2024-10-12 00:19:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 89 transitions. Stem has 75 letters. Loop has 4 letters. [2024-10-12 00:19:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:19:25,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 143 transitions. [2024-10-12 00:19:25,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:25,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 110 states and 136 transitions. [2024-10-12 00:19:25,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-12 00:19:25,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-12 00:19:25,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 136 transitions. [2024-10-12 00:19:25,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:25,740 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-10-12 00:19:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 136 transitions. [2024-10-12 00:19:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-10-12 00:19:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 94 states have internal predecessors, (110), 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-12 00:19:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-10-12 00:19:25,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-10-12 00:19:25,741 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-10-12 00:19:25,741 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-10-12 00:19:25,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 110 transitions. [2024-10-12 00:19:25,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:25,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:25,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:25,742 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:25,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:19:25,742 INFO L745 eck$LassoCheckResult]: Stem: 13909#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 13897#L561 assume !(main_~array_size~0#1 < 1); 13898#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 13899#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13900#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13901#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13902#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13905#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13931#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13930#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13929#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13928#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13927#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13926#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13925#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13924#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13923#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13922#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13921#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13920#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13919#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13918#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13917#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13916#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13915#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13914#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 13913#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 13912#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 13911#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 13906#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13907#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13985#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13984#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13908#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13894#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13895#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13903#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13904#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13982#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13981#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13980#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13979#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13977#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13976#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13975#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13974#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13972#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13971#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13970#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13969#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13967#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13966#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13965#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13964#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13962#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13961#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13960#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13959#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13957#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13956#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13955#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13954#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13952#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13951#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13950#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13949#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13947#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13946#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13945#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13944#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13942#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13941#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13940#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13939#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13938#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13935#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 13934#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 13932#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 13892#L552-3 [2024-10-12 00:19:25,742 INFO L747 eck$LassoCheckResult]: Loop: 13892#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 13893#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 13892#L552-3 [2024-10-12 00:19:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1783632790, now seen corresponding path program 24 times [2024-10-12 00:19:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865235257] [2024-10-12 00:19:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:19:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 231 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:19:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865235257] [2024-10-12 00:19:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865235257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:19:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003808802] [2024-10-12 00:19:26,205 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 00:19:26,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:19:26,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:19:26,206 INFO L229 MonitoredProcess]: Starting monitored process 240 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:19:26,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (240)] Waiting until timeout for monitored process [2024-10-12 00:19:26,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-12 00:19:26,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:19:26,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 00:19:26,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:19:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:26,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:19:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 276 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:19:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003808802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:19:27,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:19:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 43 [2024-10-12 00:19:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077762336] [2024-10-12 00:19:27,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:19:27,151 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:19:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 24 times [2024-10-12 00:19:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:27,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783932139] [2024-10-12 00:19:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:19:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-12 00:19:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1467, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 00:19:27,200 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. cyclomatic complexity: 30 Second operand has 44 states, 43 states have (on average 3.186046511627907) internal successors, (137), 44 states have internal predecessors, (137), 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-12 00:19:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:19:27,405 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2024-10-12 00:19:27,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 187 transitions. [2024-10-12 00:19:27,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:27,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 98 states and 113 transitions. [2024-10-12 00:19:27,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:19:27,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:19:27,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 113 transitions. [2024-10-12 00:19:27,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:19:27,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-10-12 00:19:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 113 transitions. [2024-10-12 00:19:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-12 00:19:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 96 states have internal predecessors, (112), 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-12 00:19:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-10-12 00:19:27,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-10-12 00:19:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 00:19:27,412 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-10-12 00:19:27,412 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-10-12 00:19:27,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 112 transitions. [2024-10-12 00:19:27,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:19:27,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:19:27,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:19:27,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2024-10-12 00:19:27,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:19:27,413 INFO L745 eck$LassoCheckResult]: Stem: 14677#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14678#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~1#1, main_#t~ret11#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet7#1;main_~array_size~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 14667#L561 assume !(main_~array_size~0#1 < 1); 14668#L561-2 call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~1#1 := 0; 14669#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14670#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14671#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14672#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14707#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14706#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14705#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14704#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14703#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14702#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14701#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14700#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14699#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14698#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14697#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14696#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14695#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14694#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14693#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14692#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14691#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14690#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14689#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14688#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14687#L565-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet9#1; 14685#L565-2 main_#t~post10#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 14684#L565-3 assume !(main_~i~1#1 < main_~array_size~0#1); 14679#L565-4 havoc main_~i~1#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#res#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~post6#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~res~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~res~0#1 := 0;test_fun_~i~0#1 := 0; 14675#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14664#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14665#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14673#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14674#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14676#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14757#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14756#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14755#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14753#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14752#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14751#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14750#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14748#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14747#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14746#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14745#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14743#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14742#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14741#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14740#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14738#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14737#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14736#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14735#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14733#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14732#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14731#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14730#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14728#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14727#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14726#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14725#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14723#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14722#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14721#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14720#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14718#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14717#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14716#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14715#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14713#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14712#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14711#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14710#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14709#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14683#L552-1 assume !(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1; 14682#L551-2 test_fun_#t~post6#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post6#1;havoc test_fun_#t~post6#1; 14680#L551-3 assume !!(test_fun_~i~0#1 < test_fun_~N#1); 14662#L552-3 [2024-10-12 00:19:27,413 INFO L747 eck$LassoCheckResult]: Loop: 14662#L552-3 call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4); 14663#L552-1 assume !!(test_fun_#t~mem2#1 > 0);havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(test_fun_#t~post4#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~res~0#1;test_fun_~res~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1; 14662#L552-3 [2024-10-12 00:19:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash -183171724, now seen corresponding path program 25 times [2024-10-12 00:19:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775245607] [2024-10-12 00:19:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 25 times [2024-10-12 00:19:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950543055] [2024-10-12 00:19:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:19:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:19:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 65633529, now seen corresponding path program 12 times [2024-10-12 00:19:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:19:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660047507] [2024-10-12 00:19:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:19:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:19:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:19:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:19:27,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace