./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/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.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/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.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 8fbd99b1bfb27b318d252229087f8d9132096866b72085e8874326b5a6d541b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:17:32,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:17:32,287 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:17:32,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:17:32,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:17:32,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:17:32,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:17:32,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:17:32,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:17:32,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:17:32,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:17:32,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:17:32,336 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:17:32,337 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:17:32,337 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:17:32,339 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:17:32,339 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:17:32,339 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:17:32,339 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:17:32,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:17:32,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:17:32,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:17:32,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:17:32,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:17:32,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:17:32,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:17:32,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:17:32,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:17:32,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:17:32,347 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:17:32,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:17:32,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:17:32,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:17:32,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:17:32,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:17:32,348 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:17:32,349 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 -> 8fbd99b1bfb27b318d252229087f8d9132096866b72085e8874326b5a6d541b4 [2024-10-12 00:17:32,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:17:32,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:17:32,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:17:32,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:17:32,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:17:32,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2024-10-12 00:17:34,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:17:34,372 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:17:34,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2024-10-12 00:17:34,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da9e776fa/9879f24d8f2443acbac3575242c9093b/FLAGc43d2d3b8 [2024-10-12 00:17:34,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da9e776fa/9879f24d8f2443acbac3575242c9093b [2024-10-12 00:17:34,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:17:34,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:17:34,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:17:34,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:17:34,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:17:34,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:17:34" (1/1) ... [2024-10-12 00:17:34,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569dcf3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:34, skipping insertion in model container [2024-10-12 00:17:34,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:17:34" (1/1) ... [2024-10-12 00:17:34,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:17:35,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:17:35,027 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:17:35,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:17:35,095 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:17:35,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35 WrapperNode [2024-10-12 00:17:35,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:17:35,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:17:35,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:17:35,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:17:35,104 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:17:35" (1/1) ... [2024-10-12 00:17:35,119 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:17:35" (1/1) ... [2024-10-12 00:17:35,139 INFO L138 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2024-10-12 00:17:35,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:17:35,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:17:35,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:17:35,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:17:35,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,193 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [3, 5, 6]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 1, 3]. [2024-10-12 00:17:35,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:17:35,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:17:35,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:17:35,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:17:35,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (1/1) ... [2024-10-12 00:17:35,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:35,270 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:17:35,273 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:17:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:17:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:17:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:17:35,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:17:35,524 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:17:35,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:17:35,795 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-12 00:17:35,795 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:17:35,807 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:17:35,807 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:17:35,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:17:35 BoogieIcfgContainer [2024-10-12 00:17:35,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:17:35,809 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:17:35,809 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:17:35,813 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:17:35,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:17:35,814 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:17:34" (1/3) ... [2024-10-12 00:17:35,815 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4049983c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:17:35, skipping insertion in model container [2024-10-12 00:17:35,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:17:35,815 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:17:35" (2/3) ... [2024-10-12 00:17:35,815 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4049983c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:17:35, skipping insertion in model container [2024-10-12 00:17:35,816 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:17:35,816 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:17:35" (3/3) ... [2024-10-12 00:17:35,817 INFO L332 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i [2024-10-12 00:17:35,869 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:17:35,869 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:17:35,869 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:17:35,869 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:17:35,870 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:17:35,870 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:17:35,870 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:17:35,870 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:17:35,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:35,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:35,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:35,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:35,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:17:35,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:35,900 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:17:35,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:35,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:35,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:35,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:35,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:17:35,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:35,909 INFO L745 eck$LassoCheckResult]: Stem: 12#$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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 9#L552true assume !main_#t~short9#1; 10#L552-2true assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 6#L556-2true [2024-10-12 00:17:35,910 INFO L747 eck$LassoCheckResult]: Loop: 6#L556-2true call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 13#L555-1true assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 4#L555-3true assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 5#L556true assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 6#L556-2true [2024-10-12 00:17:35,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2024-10-12 00:17:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:35,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257935960] [2024-10-12 00:17:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:36,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:17:36,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257935960] [2024-10-12 00:17:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257935960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:17:36,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:17:36,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:17:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991870703] [2024-10-12 00:17:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:17:36,206 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:17:36,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1419305, now seen corresponding path program 1 times [2024-10-12 00:17:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793818356] [2024-10-12 00:17:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:17:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:17:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:17:36,597 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:17:36,618 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2024-10-12 00:17:36,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2024-10-12 00:17:36,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:36,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 8 states and 10 transitions. [2024-10-12 00:17:36,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:17:36,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:17:36,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2024-10-12 00:17:36,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:17:36,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-10-12 00:17:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2024-10-12 00:17:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-12 00:17:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2024-10-12 00:17:36,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-10-12 00:17:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:17:36,661 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-10-12 00:17:36,665 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:17:36,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2024-10-12 00:17:36,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:36,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:36,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:36,666 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:17:36,667 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:36,667 INFO L745 eck$LassoCheckResult]: Stem: 40#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 43#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 36#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 37#L556-2 [2024-10-12 00:17:36,667 INFO L747 eck$LassoCheckResult]: Loop: 37#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 42#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 38#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 39#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 37#L556-2 [2024-10-12 00:17:36,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2024-10-12 00:17:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444757623] [2024-10-12 00:17:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1419305, now seen corresponding path program 2 times [2024-10-12 00:17:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633578136] [2024-10-12 00:17:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 121353169, now seen corresponding path program 1 times [2024-10-12 00:17:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767458537] [2024-10-12 00:17:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:36,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:37,696 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:37,696 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:37,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:37,697 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:37,697 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:37,697 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:37,697 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:37,697 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:37,697 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration2_Lasso [2024-10-12 00:17:37,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:37,698 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:37,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:37,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:38,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:38,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:38,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:38,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:38,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:38,519 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:38,524 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:38,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,531 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:17:38,535 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:17:38,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,579 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:17:38,581 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:17:38,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,624 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:17:38,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,629 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:17:38,641 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:17:38,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,658 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:17:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,680 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:17:38,682 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:17:38,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,699 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,712 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:17:38,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,714 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:17:38,716 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:17:38,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:17:38,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:38,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:38,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,752 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:17:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,755 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:17:38,756 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:17:38,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,788 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:17:38,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,790 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:17:38,792 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:17:38,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,825 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:17:38,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,827 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:17:38,828 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:17:38,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,861 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:17:38,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,868 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:17:38,869 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:17:38,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:17:38,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,900 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:17:38,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,902 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:17:38,903 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:17:38,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:17:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,958 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:17:38,959 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:17:38,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:38,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:38,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:38,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:38,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:38,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:38,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:38,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:38,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:38,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:38,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:38,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:38,989 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:17:38,990 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:17:38,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:39,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:39,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:39,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,015 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:17:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,018 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:17:39,018 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:17:39,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:39,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,052 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:17:39,054 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:17:39,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:39,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:39,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:39,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:17:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,089 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:17:39,093 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:17:39,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:39,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:39,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,134 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:17:39,135 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:17:39,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,175 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:17:39,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,177 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:17:39,179 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:17:39,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,213 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:17:39,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,216 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:17:39,218 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:17:39,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,259 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:17:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,261 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:17:39,263 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:17:39,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,315 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:17:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,318 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:17:39,329 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:17:39,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:17:39,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,376 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:17:39,379 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:17:39,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:39,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:39,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:39,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:39,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:39,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:39,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,417 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:17:39,418 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:17:39,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:17:39,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:39,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:39,432 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:17:39,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:39,446 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:17:39,446 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:17:39,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:39,583 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2024-10-12 00:17:39,584 INFO L444 ModelExtractionUtils]: 2 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-10-12 00:17:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:39,588 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:17:39,589 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:17:39,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:39,605 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 4. [2024-10-12 00:17:39,605 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:39,606 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) 0)_1) = 2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) 0)_1 + 1 Supporting invariants [1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_1 - 1 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_1 >= 0, 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) 0)_1 >= 0] [2024-10-12 00:17:39,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:17:39,693 INFO L156 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2024-10-12 00:17:39,703 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:17:39,704 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:17:39,704 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:17:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:39,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:17:39,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:39,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:17:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:39,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 00:17:39,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:39,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:17:39,934 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:17:39,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:40,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 22 transitions. Complement of second has 9 states. [2024-10-12 00:17:40,025 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:17:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2024-10-12 00:17:40,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:17:40,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:40,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-12 00:17:40,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:40,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 4 letters. Loop has 8 letters. [2024-10-12 00:17:40,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:40,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2024-10-12 00:17:40,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:40,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2024-10-12 00:17:40,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-12 00:17:40,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-12 00:17:40,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2024-10-12 00:17:40,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:40,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-12 00:17:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2024-10-12 00:17:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-12 00:17:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) 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:17:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2024-10-12 00:17:40,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-12 00:17:40,032 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2024-10-12 00:17:40,032 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:17:40,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2024-10-12 00:17:40,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:40,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:40,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:40,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:40,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:40,034 INFO L745 eck$LassoCheckResult]: Stem: 234#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 236#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 223#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 224#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 233#L555-1 assume !main_#t~short15#1; 225#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 226#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 229#L556-2 [2024-10-12 00:17:40,034 INFO L747 eck$LassoCheckResult]: Loop: 229#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 231#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 238#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 237#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 229#L556-2 [2024-10-12 00:17:40,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:40,035 INFO L85 PathProgramCache]: Analyzing trace with hash 121355089, now seen corresponding path program 1 times [2024-10-12 00:17:40,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870267061] [2024-10-12 00:17:40,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:40,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:40,166 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:17:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870267061] [2024-10-12 00:17:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870267061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:17:40,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:17:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:17:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383405599] [2024-10-12 00:17:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:17:40,168 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:17:40,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1419305, now seen corresponding path program 3 times [2024-10-12 00:17:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549659580] [2024-10-12 00:17:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:40,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:17:40,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:17:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:17:40,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:17:40,595 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:17:40,666 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2024-10-12 00:17:40,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2024-10-12 00:17:40,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:40,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 28 transitions. [2024-10-12 00:17:40,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:17:40,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-12 00:17:40,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-10-12 00:17:40,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:40,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-12 00:17:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-10-12 00:17:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-10-12 00:17:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 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:17:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-12 00:17:40,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 00:17:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:17:40,677 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 00:17:40,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:17:40,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-10-12 00:17:40,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:40,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:40,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:40,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:40,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:40,678 INFO L745 eck$LassoCheckResult]: Stem: 282#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 284#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 270#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 271#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 279#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 272#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 273#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 276#L556-2 [2024-10-12 00:17:40,678 INFO L747 eck$LassoCheckResult]: Loop: 276#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 287#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 286#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 285#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 276#L556-2 [2024-10-12 00:17:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash 121353167, now seen corresponding path program 1 times [2024-10-12 00:17:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398186888] [2024-10-12 00:17:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:40,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1419305, now seen corresponding path program 4 times [2024-10-12 00:17:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691945629] [2024-10-12 00:17:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:40,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash -677985033, now seen corresponding path program 1 times [2024-10-12 00:17:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:40,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501479896] [2024-10-12 00:17:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:40,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:41,823 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:41,824 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:41,824 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:41,824 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:41,824 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:41,824 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:41,824 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:41,824 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:41,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration4_Lasso [2024-10-12 00:17:41,825 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:41,825 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:41,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:41,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:42,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:42,647 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:42,648 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:42,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,649 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:17:42,650 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:17:42,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:42,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,675 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:17:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,678 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:17:42,679 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:17:42,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:42,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,704 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:17:42,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,707 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:17:42,711 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:17:42,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:42,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,727 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,740 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:17:42,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,742 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:17:42,743 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:17:42,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:17:42,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,772 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:17:42,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,774 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:17:42,775 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:17:42,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:17:42,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,805 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:17:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,807 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:17:42,808 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:17:42,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:42,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,837 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:17:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,842 INFO L229 MonitoredProcess]: Starting monitored process 31 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:17:42,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:42,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:17:42,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:42,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:42,862 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:17:42,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,881 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:17:42,882 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:17:42,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:42,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,918 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:17:42,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:42,923 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:17:42,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,942 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:17:42,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,944 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:17:42,946 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:17:42,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:42,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:42,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:42,976 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:17:42,977 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:17:42,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:42,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:42,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:42,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:42,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:42,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:42,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:42,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:42,989 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-10-12 00:17:43,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,002 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:17:43,007 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:17:43,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:43,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:43,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:43,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,036 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:17:43,037 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:17:43,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:43,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:43,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:43,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:43,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,076 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:17:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,078 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:17:43,079 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:17:43,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,116 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:17:43,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,121 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:17:43,126 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:17:43,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:43,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:43,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:43,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,156 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:17:43,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,158 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:17:43,164 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:17:43,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:43,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:43,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:43,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,197 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:17:43,198 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:17:43,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:17:43,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:43,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,231 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:17:43,232 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:17:43,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:43,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:43,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:43,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:43,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,265 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:17:43,267 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:17:43,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,328 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:17:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,331 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:17:43,335 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:17:43,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:17:43,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,409 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:17:43,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,412 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:17:43,414 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:17:43,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-12 00:17:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,497 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:17:43,503 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:17:43,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,530 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:17:43,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,532 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:17:43,533 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:17:43,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-12 00:17:43,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,569 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:17:43,570 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:17:43,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:43,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-12 00:17:43,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,600 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:17:43,601 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:17:43,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:17:43,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-12 00:17:43,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,632 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:17:43,633 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:17:43,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:43,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:43,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:43,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:43,651 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:43,662 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:17:43,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,664 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:17:43,665 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:17:43,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:43,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:43,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:43,678 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:17:43,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:43,692 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:17:43,692 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:17:43,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:43,779 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2024-10-12 00:17:43,779 INFO L444 ModelExtractionUtils]: 3 out of 31 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-10-12 00:17:43,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:43,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:43,781 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:17:43,782 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:17:43,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:43,796 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 4. [2024-10-12 00:17:43,796 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:43,796 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_2 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) 0)_2 >= 0, 2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_2 >= 0, 2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_2 - 1 >= 0] [2024-10-12 00:17:43,809 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:17:43,867 INFO L156 tatePredicateManager]: 26 out of 27 supporting invariants were superfluous and have been removed [2024-10-12 00:17:43,869 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:17:43,869 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:17:43,870 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:17:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:43,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:43,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:43,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:17:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:43,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:43,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:44,032 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:17:44,033 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:17:44,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:17:44,111 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 26 states and 36 transitions. Complement of second has 10 states. [2024-10-12 00:17:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:17:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2024-10-12 00:17:44,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-12 00:17:44,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:44,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:17:44,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:44,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 8 letters. Loop has 8 letters. [2024-10-12 00:17:44,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:44,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 36 transitions. [2024-10-12 00:17:44,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:44,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 36 transitions. [2024-10-12 00:17:44,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:17:44,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:17:44,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2024-10-12 00:17:44,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:44,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2024-10-12 00:17:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2024-10-12 00:17:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-12 00:17:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2024-10-12 00:17:44,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2024-10-12 00:17:44,117 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2024-10-12 00:17:44,117 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:17:44,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. [2024-10-12 00:17:44,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:44,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:44,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:44,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:44,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:44,118 INFO L745 eck$LassoCheckResult]: Stem: 505#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 512#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 496#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 497#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 513#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 498#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 499#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 507#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 508#L555-1 assume !main_#t~short15#1; 518#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 502#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 503#L556-2 [2024-10-12 00:17:44,119 INFO L747 eck$LassoCheckResult]: Loop: 503#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 517#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 516#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 515#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 503#L556-2 [2024-10-12 00:17:44,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -677983113, now seen corresponding path program 1 times [2024-10-12 00:17:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:44,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621439989] [2024-10-12 00:17:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 00:17:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:44,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621439989] [2024-10-12 00:17:44,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621439989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:17:44,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:17:44,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:17:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910676251] [2024-10-12 00:17:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:17:44,150 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:17:44,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1419305, now seen corresponding path program 5 times [2024-10-12 00:17:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306773193] [2024-10-12 00:17:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:17:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:17:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:17:44,267 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:17:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:17:44,272 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-12 00:17:44,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-10-12 00:17:44,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:44,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 31 transitions. [2024-10-12 00:17:44,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:17:44,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:17:44,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2024-10-12 00:17:44,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:44,274 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-12 00:17:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2024-10-12 00:17:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-12 00:17:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 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:17:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-12 00:17:44,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-12 00:17:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:17:44,277 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-12 00:17:44,277 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:17:44,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2024-10-12 00:17:44,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:17:44,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:44,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:44,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-10-12 00:17:44,278 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:44,278 INFO L745 eck$LassoCheckResult]: Stem: 567#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 568#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 572#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 559#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 560#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 580#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 561#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 562#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 565#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 569#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 573#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 579#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 576#L556-2 [2024-10-12 00:17:44,278 INFO L747 eck$LassoCheckResult]: Loop: 576#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 578#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 577#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 575#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 576#L556-2 [2024-10-12 00:17:44,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash -677985035, now seen corresponding path program 2 times [2024-10-12 00:17:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979816806] [2024-10-12 00:17:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:44,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1419305, now seen corresponding path program 6 times [2024-10-12 00:17:44,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:44,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247359637] [2024-10-12 00:17:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:44,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash -199699683, now seen corresponding path program 2 times [2024-10-12 00:17:44,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888090774] [2024-10-12 00:17:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:44,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:44,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:45,565 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:45,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:45,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:45,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:45,565 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:45,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:45,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:45,565 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:45,566 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration6_Lasso [2024-10-12 00:17:45,566 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:45,566 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:45,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:45,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:46,118 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:46,119 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:46,123 INFO L229 MonitoredProcess]: Starting monitored process 53 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:17:46,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-12 00:17:46,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:46,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:46,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:46,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:46,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:46,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:46,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:46,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:46,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:46,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:46,161 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:17:46,162 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:17:46,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:46,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:46,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:46,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:46,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:46,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:46,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:46,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:46,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:46,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-12 00:17:46,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:46,191 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:17:46,192 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:17:46,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:46,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:46,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:46,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:46,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:46,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:46,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:46,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:46,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:46,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:46,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:46,244 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:17:46,249 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:17:46,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:46,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:46,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:46,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:46,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:46,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:46,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:46,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:46,296 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:17:46,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:46,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:46,298 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:17:46,301 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:17:46,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:46,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:46,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:46,312 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:17:46,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:46,319 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:17:46,319 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:17:46,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:46,354 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-12 00:17:46,354 INFO L444 ModelExtractionUtils]: 6 out of 26 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-10-12 00:17:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:46,357 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:17:46,362 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:17:46,362 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:46,379 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 4. [2024-10-12 00:17:46,379 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:46,379 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_3) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_3 Supporting invariants [2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_3 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) 0)_3 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_3 >= 0, 2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_3 - 1 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) 0)_3 >= 0] [2024-10-12 00:17:46,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:46,460 INFO L156 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2024-10-12 00:17:46,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:17:46,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:17:46,462 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:17:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:46,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:46,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:46,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:17:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:46,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:46,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:46,720 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:17:46,722 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:17:46,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:46,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 10 states. [2024-10-12 00:17:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2024-10-12 00:17:46,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 13 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:17:46,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:46,809 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:46,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:46,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:46,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:46,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:17:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:46,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:46,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:47,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:17:47,010 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:17:47,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:47,092 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 10 states. [2024-10-12 00:17:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2024-10-12 00:17:47,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 13 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:17:47,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:47,096 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:47,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:47,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:47,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-12 00:17:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:47,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:47,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:47,379 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:17:47,379 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:17:47,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:47,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 42 transitions. Complement of second has 9 states. [2024-10-12 00:17:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2024-10-12 00:17:47,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-12 00:17:47,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:47,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 16 letters. Loop has 4 letters. [2024-10-12 00:17:47,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:47,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 14 transitions. Stem has 12 letters. Loop has 8 letters. [2024-10-12 00:17:47,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:47,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2024-10-12 00:17:47,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:17:47,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 28 states and 34 transitions. [2024-10-12 00:17:47,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:17:47,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:17:47,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2024-10-12 00:17:47,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:47,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-12 00:17:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2024-10-12 00:17:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 12. [2024-10-12 00:17:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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:17:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-10-12 00:17:47,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-12 00:17:47,519 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-12 00:17:47,519 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:17:47,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2024-10-12 00:17:47,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:17:47,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:47,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:47,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:17:47,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:47,521 INFO L745 eck$LassoCheckResult]: Stem: 1011#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1012#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1013#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1002#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1003#L556-2 [2024-10-12 00:17:47,521 INFO L747 eck$LassoCheckResult]: Loop: 1003#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1010#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1004#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1005#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 1003#L556-2 [2024-10-12 00:17:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 2 times [2024-10-12 00:17:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088032553] [2024-10-12 00:17:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1419303, now seen corresponding path program 1 times [2024-10-12 00:17:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932094682] [2024-10-12 00:17:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:47,586 INFO L85 PathProgramCache]: Analyzing trace with hash 121353167, now seen corresponding path program 3 times [2024-10-12 00:17:47,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178509079] [2024-10-12 00:17:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:47,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:47,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:48,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:48,580 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:48,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:48,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:48,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:48,581 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:48,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:48,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:48,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:48,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration7_Lasso [2024-10-12 00:17:48,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:48,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:48,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:48,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:49,232 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:49,232 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:49,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,235 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:17:49,236 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:17:49,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:49,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:49,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:49,254 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:17:49,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:49,264 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:17:49,265 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:17:49,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:49,295 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-12 00:17:49,295 INFO L444 ModelExtractionUtils]: 8 out of 21 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-12 00:17:49,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:49,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:49,297 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:17:49,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:49,305 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:17:49,317 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-10-12 00:17:49,317 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:49,317 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_4, v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_4) = -1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_4 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_4 Supporting invariants [] [2024-10-12 00:17:49,329 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:17:49,385 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2024-10-12 00:17:49,386 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:17:49,386 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:17:49,386 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~maxId~0!base,]]] [2024-10-12 00:17:49,387 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:17:49,387 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:17:49,387 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:17:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:49,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:17:49,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:49,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 00:17:49,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:49,452 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:17:49,453 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:17:49,453 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:49,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 32 transitions. Complement of second has 7 states. [2024-10-12 00:17:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-12 00:17:49,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-12 00:17:49,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:49,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2024-10-12 00:17:49,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:49,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2024-10-12 00:17:49,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:49,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2024-10-12 00:17:49,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:17:49,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2024-10-12 00:17:49,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-12 00:17:49,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:17:49,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2024-10-12 00:17:49,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:49,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:17:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2024-10-12 00:17:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-10-12 00:17:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 00:17:49,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:17:49,493 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 00:17:49,494 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:17:49,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-10-12 00:17:49,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-12 00:17:49,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:49,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:49,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:49,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-12 00:17:49,494 INFO L745 eck$LassoCheckResult]: Stem: 1182#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1184#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1171#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1172#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1180#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1175#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1176#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1186#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1185#L555-1 [2024-10-12 00:17:49,494 INFO L747 eck$LassoCheckResult]: Loop: 1185#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1173#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1174#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 1177#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1185#L555-1 [2024-10-12 00:17:49,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash -533019041, now seen corresponding path program 2 times [2024-10-12 00:17:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964829872] [2024-10-12 00:17:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:49,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:49,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:49,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1516443, now seen corresponding path program 2 times [2024-10-12 00:17:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71839905] [2024-10-12 00:17:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:49,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:49,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 514558713, now seen corresponding path program 3 times [2024-10-12 00:17:49,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:49,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337771547] [2024-10-12 00:17:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:49,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:49,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:49,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:50,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:50,873 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:50,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:50,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:50,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:50,874 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:50,874 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:50,874 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:50,874 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:50,874 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration8_Lasso [2024-10-12 00:17:50,874 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:50,874 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:50,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:50,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:51,754 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:51,755 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:51,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,756 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:17:51,757 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:17:51,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,780 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:17:51,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,783 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:17:51,784 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:17:51,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,807 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:17:51,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,809 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:17:51,810 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:17:51,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:51,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,835 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:17:51,836 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:17:51,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,865 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:17:51,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,867 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:17:51,868 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:17:51,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:17:51,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,900 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:17:51,902 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:17:51,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:51,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:51,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,930 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:17:51,931 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:17:51,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,956 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:17:51,957 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:17:51,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:51,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:51,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-12 00:17:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:51,985 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:17:51,987 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:17:51,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:51,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:51,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:51,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:51,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:51,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:51,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:51,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,013 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:17:52,014 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:17:52,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:17:52,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,048 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:17:52,049 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:17:52,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,074 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:17:52,075 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:17:52,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:17:52,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,098 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:17:52,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,099 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:17:52,100 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:17:52,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,126 INFO L229 MonitoredProcess]: Starting monitored process 74 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:17:52,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-12 00:17:52,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-12 00:17:52,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,151 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:17:52,152 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:17:52,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,177 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:17:52,178 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:17:52,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:52,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:52,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:52,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,202 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:17:52,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,203 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:17:52,204 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:17:52,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,234 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:17:52,235 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:17:52,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,263 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:17:52,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,265 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:17:52,266 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:17:52,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,295 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:17:52,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,297 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:17:52,298 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:17:52,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,333 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:17:52,334 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:17:52,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:52,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:52,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:52,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:52,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:52,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:52,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:52,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,363 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:17:52,364 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:17:52,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:17:52,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:52,376 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-12 00:17:52,376 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-12 00:17:52,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:52,404 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2024-10-12 00:17:52,405 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-10-12 00:17:52,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:52,507 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-10-12 00:17:52,507 INFO L444 ModelExtractionUtils]: 28 out of 43 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-10-12 00:17:52,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:52,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:52,510 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:17:52,511 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:17:52,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:52,525 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2024-10-12 00:17:52,525 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:52,525 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) 0)_1, v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_5) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) 0)_1 - 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_5 Supporting invariants [] [2024-10-12 00:17:52,538 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:17:52,608 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2024-10-12 00:17:52,610 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-12 00:17:52,610 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-12 00:17:52,610 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~maxId~0!base,]]] [2024-10-12 00:17:52,610 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:17:52,610 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:17:52,611 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:17:52,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:52,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:52,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:52,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:52,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:52,796 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:17:52,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-10-12 00:17:52,859 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:17:52,863 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 00:17:52,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:52,935 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 34 transitions. Complement of second has 8 states. [2024-10-12 00:17:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2024-10-12 00:17:52,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:17:52,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:52,940 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-10-12 00:17:53,114 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:17:53,115 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 00:17:53,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:53,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 29 transitions. Complement of second has 10 states. [2024-10-12 00:17:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2024-10-12 00:17:53,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:17:53,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,161 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:53,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-10-12 00:17:53,296 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:17:53,296 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-10-12 00:17:53,296 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:53,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 41 transitions. Complement of second has 9 states. [2024-10-12 00:17:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-12 00:17:53,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-12 00:17:53,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 4 letters. [2024-10-12 00:17:53,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 9 letters. Loop has 8 letters. [2024-10-12 00:17:53,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:53,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2024-10-12 00:17:53,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-12 00:17:53,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 21 states and 25 transitions. [2024-10-12 00:17:53,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:17:53,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-10-12 00:17:53,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-10-12 00:17:53,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:53,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-12 00:17:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-10-12 00:17:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2024-10-12 00:17:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 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:17:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-10-12 00:17:53,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-12 00:17:53,350 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-12 00:17:53,350 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:17:53,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2024-10-12 00:17:53,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:17:53,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:53,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:53,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:53,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2024-10-12 00:17:53,351 INFO L745 eck$LassoCheckResult]: Stem: 1548#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1549#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1550#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1541#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1542#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1546#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1554#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1553#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1552#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1551#L555-1 [2024-10-12 00:17:53,351 INFO L747 eck$LassoCheckResult]: Loop: 1551#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1543#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1544#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 1545#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1546#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1554#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1553#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1552#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1551#L555-1 [2024-10-12 00:17:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash -533019041, now seen corresponding path program 3 times [2024-10-12 00:17:53,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139121230] [2024-10-12 00:17:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:53,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash 308210291, now seen corresponding path program 1 times [2024-10-12 00:17:53,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:53,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243485950] [2024-10-12 00:17:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:53,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2006217425, now seen corresponding path program 4 times [2024-10-12 00:17:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:53,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103021370] [2024-10-12 00:17:53,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:53,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:17:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103021370] [2024-10-12 00:17:53,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103021370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:17:53,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018676748] [2024-10-12 00:17:53,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 00:17:53,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:17:53,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:53,863 INFO L229 MonitoredProcess]: Starting monitored process 84 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:17:53,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2024-10-12 00:17:53,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 00:17:53,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:17:53,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 00:17:53,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:53,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:17:54,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:54,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-10-12 00:17:54,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-10-12 00:17:54,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:54,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-12 00:17:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:54,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:17:54,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-10-12 00:17:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018676748] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:17:54,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:17:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 21 [2024-10-12 00:17:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9757294] [2024-10-12 00:17:54,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:17:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:17:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 00:17:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-12 00:17:54,532 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 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:17:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:17:55,026 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-12 00:17:55,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 48 transitions. [2024-10-12 00:17:55,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:17:55,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 23 states and 24 transitions. [2024-10-12 00:17:55,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:17:55,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-12 00:17:55,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2024-10-12 00:17:55,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:17:55,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-12 00:17:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2024-10-12 00:17:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2024-10-12 00:17:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-10-12 00:17:55,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-12 00:17:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 00:17:55,030 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-10-12 00:17:55,030 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:17:55,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2024-10-12 00:17:55,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:17:55,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:17:55,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:17:55,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:17:55,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1] [2024-10-12 00:17:55,031 INFO L745 eck$LassoCheckResult]: Stem: 1769#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 1771#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 1759#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 1760#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1768#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1763#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1764#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 1775#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1774#L555-1 [2024-10-12 00:17:55,031 INFO L747 eck$LassoCheckResult]: Loop: 1774#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1761#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1762#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 1765#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1772#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1773#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1766#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 1767#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1768#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 1763#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 1764#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 1775#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 1774#L555-1 [2024-10-12 00:17:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash -533019103, now seen corresponding path program 4 times [2024-10-12 00:17:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985307703] [2024-10-12 00:17:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:55,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2141145587, now seen corresponding path program 2 times [2024-10-12 00:17:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:55,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244257477] [2024-10-12 00:17:55,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 16993325, now seen corresponding path program 5 times [2024-10-12 00:17:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:17:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696329772] [2024-10-12 00:17:55,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:17:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:17:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:17:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:17:55,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:17:56,310 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:17:56,310 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:17:56,310 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:17:56,310 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:17:56,310 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:17:56,310 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:56,310 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:17:56,310 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:17:56,311 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration10_Lasso [2024-10-12 00:17:56,311 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:17:56,311 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:17:56,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:17:56,989 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:17:56,989 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:17:56,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:56,991 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:17:56,992 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:17:56,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,016 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:17:57,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,017 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:17:57,018 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:17:57,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,044 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:17:57,045 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:17:57,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,071 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:17:57,071 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:17:57,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:57,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:57,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:57,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,101 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:17:57,102 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:17:57,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,127 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:17:57,128 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:17:57,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,153 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:17:57,154 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:17:57,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:17:57,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-10-12 00:17:57,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,179 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:17:57,180 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:17:57,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,204 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:17:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,206 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:17:57,207 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:17:57,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,229 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:17:57,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,231 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:17:57,232 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:17:57,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:17:57,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:17:57,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:17:57,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,257 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:17:57,258 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:17:57,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:57,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:57,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,288 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:17:57,289 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:17:57,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:17:57,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:57,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:57,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,316 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:17:57,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,318 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:17:57,319 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:17:57,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:17:57,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:17:57,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:17:57,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:17:57,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-10-12 00:17:57,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,348 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:17:57,349 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:17:57,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17:57,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:17:57,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:17:57,360 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-12 00:17:57,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:17:57,372 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2024-10-12 00:17:57,372 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-10-12 00:17:57,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:17:57,490 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-10-12 00:17:57,491 INFO L444 ModelExtractionUtils]: 7 out of 36 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-10-12 00:17:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:17:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:17:57,493 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:17:57,494 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:17:57,494 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:17:57,509 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 6. [2024-10-12 00:17:57,509 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:17:57,509 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_6) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_6 Supporting invariants [-1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_6 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_6 - 2 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_6 >= 0] [2024-10-12 00:17:57,525 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:17:57,575 INFO L156 tatePredicateManager]: 21 out of 23 supporting invariants were superfluous and have been removed [2024-10-12 00:17:57,580 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:17:57,580 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:17:57,580 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:17:57,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:57,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:57,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:57,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:17:57,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:57,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:17:57,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:57,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:17:57,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:17:57,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-10-12 00:17:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:57,962 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 7 loop predicates [2024-10-12 00:17:57,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:58,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 19 transitions. Complement of second has 6 states. [2024-10-12 00:17:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2024-10-12 00:17:58,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 9 letters. Loop has 12 letters. [2024-10-12 00:17:58,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:58,007 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:58,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:58,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:58,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:58,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:17:58,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:58,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:17:58,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:58,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:17:58,272 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:17:58,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:17:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-10-12 00:17:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:58,440 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 7 loop predicates [2024-10-12 00:17:58,440 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:58,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 19 transitions. Complement of second has 6 states. [2024-10-12 00:17:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:17:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2024-10-12 00:17:58,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 9 letters. Loop has 12 letters. [2024-10-12 00:17:58,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:58,476 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:58,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:58,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:58,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:58,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:17:58,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:58,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:17:58,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:58,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:17:58,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:17:58,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-10-12 00:17:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:58,870 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 7 loop predicates [2024-10-12 00:17:58,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:59,010 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 28 transitions. Complement of second has 14 states. [2024-10-12 00:17:59,011 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:17:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2024-10-12 00:17:59,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 9 letters. Loop has 12 letters. [2024-10-12 00:17:59,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:59,017 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:59,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:59,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:59,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:17:59,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:59,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 00:17:59,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:59,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:17:59,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:17:59,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:17:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:17:59,524 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 9 loop predicates [2024-10-12 00:17:59,524 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:59,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 18 transitions. cyclomatic complexity: 2. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 28 transitions. Complement of second has 14 states. [2024-10-12 00:17:59,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2024-10-12 00:17:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:17:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2024-10-12 00:17:59,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 9 letters. Loop has 12 letters. [2024-10-12 00:17:59,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:17:59,693 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:17:59,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:17:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:59,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 00:17:59,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:59,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:17:59,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:17:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:17:59,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 00:17:59,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:17:59,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:18:00,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:18:00,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-10-12 00:18:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:00,340 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.6 stem predicates 9 loop predicates [2024-10-12 00:18:00,341 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:00,804 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 407 states and 511 transitions. Complement of second has 241 states 35 powerset states206 rank states. The highest rank that occured is 5 [2024-10-12 00:18:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 6 stem states 12 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:18:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 64 transitions. [2024-10-12 00:18:00,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 64 transitions. Stem has 9 letters. Loop has 12 letters. [2024-10-12 00:18:00,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:00,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 64 transitions. Stem has 21 letters. Loop has 12 letters. [2024-10-12 00:18:00,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:00,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 64 transitions. Stem has 9 letters. Loop has 24 letters. [2024-10-12 00:18:00,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:00,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 511 transitions. [2024-10-12 00:18:00,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2024-10-12 00:18:00,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 77 states and 93 transitions. [2024-10-12 00:18:00,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-10-12 00:18:00,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-12 00:18:00,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 93 transitions. [2024-10-12 00:18:00,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:00,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 93 transitions. [2024-10-12 00:18:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 93 transitions. [2024-10-12 00:18:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2024-10-12 00:18:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 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:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-10-12 00:18:00,817 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-10-12 00:18:00,817 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-10-12 00:18:00,817 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:18:00,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2024-10-12 00:18:00,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2024-10-12 00:18:00,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:00,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:00,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:00,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 1] [2024-10-12 00:18:00,818 INFO L745 eck$LassoCheckResult]: Stem: 3096#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 3100#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 3104#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 3115#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3093#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 3108#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 3107#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 3106#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3102#L555-1 [2024-10-12 00:18:00,818 INFO L747 eck$LassoCheckResult]: Loop: 3102#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 3103#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 3137#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 3136#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3134#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 3132#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 3130#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 3128#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3126#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 3124#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 3123#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 3122#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3116#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 3117#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 3109#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 3110#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3093#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 3108#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 3107#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 3106#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 3102#L555-1 [2024-10-12 00:18:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash -533019103, now seen corresponding path program 5 times [2024-10-12 00:18:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973304450] [2024-10-12 00:18:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:00,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:00,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -857811903, now seen corresponding path program 3 times [2024-10-12 00:18:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261304319] [2024-10-12 00:18:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:00,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:00,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:00,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash 756632161, now seen corresponding path program 6 times [2024-10-12 00:18:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30105744] [2024-10-12 00:18:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:00,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:00,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:02,469 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:02,470 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:02,470 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:02,470 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:02,470 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:02,470 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:02,470 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:02,470 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:02,470 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration11_Lasso [2024-10-12 00:18:02,470 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:02,470 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:02,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:02,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:03,000 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-10-12 00:18:03,562 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:03,562 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:03,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,564 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:03,565 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:03,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:03,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:03,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:03,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:03,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,603 INFO L229 MonitoredProcess]: Starting monitored process 101 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:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-12 00:18:03,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:03,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:03,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:03,620 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-12 00:18:03,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,634 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:03,635 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:03,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:03,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:03,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,648 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:03,648 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:03,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,661 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:03,662 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:03,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:03,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:03,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,687 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:03,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,689 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:03,690 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:03,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:03,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:03,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:03,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:03,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,714 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:03,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,716 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:03,717 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:03,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:03,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:03,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:03,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,741 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:03,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,743 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:03,744 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:03,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:03,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:03,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:03,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,782 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:03,783 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:03,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:03,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:03,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:03,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,817 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:03,818 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:03,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,833 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:03,833 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:03,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:03,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,850 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:03,851 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:03,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:03,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:03,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:03,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:03,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:03,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:03,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:03,882 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:03,883 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:03,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:03,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:03,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:03,895 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-12 00:18:03,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:03,918 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2024-10-12 00:18:03,918 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-10-12 00:18:03,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:04,125 INFO L443 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2024-10-12 00:18:04,125 INFO L444 ModelExtractionUtils]: 16 out of 43 variables were initially zero. Simplification set additionally 19 variables to zero. [2024-10-12 00:18:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:04,128 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:04,129 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:04,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:04,146 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 6. [2024-10-12 00:18:04,146 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:04,146 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) 0)_3) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) 0)_3 Supporting invariants [1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_7 - 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_7 - 2 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_7 >= 0] [2024-10-12 00:18:04,164 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:04,218 INFO L156 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed [2024-10-12 00:18:04,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:18:04,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:18:04,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:18:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:04,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 00:18:04,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:04,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:04,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:04,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:18:04,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:04,451 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:04,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:18:04,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:18:04,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-10-12 00:18:04,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-10-12 00:18:05,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2024-10-12 00:18:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:05,097 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 13 loop predicates [2024-10-12 00:18:05,097 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13 Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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:05,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 67 transitions. Complement of second has 6 states. [2024-10-12 00:18:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2024-10-12 00:18:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 9 letters. Loop has 20 letters. [2024-10-12 00:18:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:05,128 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:05,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:05,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:05,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:05,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:05,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:18:05,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:05,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:18:05,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:18:05,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-10-12 00:18:05,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-10-12 00:18:05,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2024-10-12 00:18:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:05,952 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 13 loop predicates [2024-10-12 00:18:05,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13 Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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:05,993 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 67 transitions. Complement of second has 6 states. [2024-10-12 00:18:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2024-10-12 00:18:05,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 9 letters. Loop has 20 letters. [2024-10-12 00:18:05,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:05,994 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:06,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:06,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:06,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:06,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:06,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:18:06,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:06,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:18:06,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:18:06,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-10-12 00:18:06,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-10-12 00:18:06,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2024-10-12 00:18:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:06,812 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 13 loop predicates [2024-10-12 00:18:06,812 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13 Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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,943 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 89 states and 102 transitions. Complement of second has 14 states. [2024-10-12 00:18:06,943 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:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2024-10-12 00:18:06,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 9 letters. Loop has 20 letters. [2024-10-12 00:18:06,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:06,944 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:06,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 00:18:06,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:07,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:07,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:07,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 00:18:07,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:07,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-10-12 00:18:07,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-12 00:18:07,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2024-10-12 00:18:07,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-10-12 00:18:07,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2024-10-12 00:18:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:07,741 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 13 loop predicates [2024-10-12 00:18:07,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13 Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 66 transitions. cyclomatic complexity: 13. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 89 states and 102 transitions. Complement of second has 14 states. [2024-10-12 00:18:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2024-10-12 00:18:07,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 9 letters. Loop has 20 letters. [2024-10-12 00:18:07,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:07,890 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:07,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:07,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 00:18:07,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:07,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:07,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:08,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-12 00:18:08,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:08,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:18:08,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:08,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:08,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:08,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:08,698 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.6 stem predicates 14 loop predicates [2024-10-12 00:18:08,699 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 55 states and 66 transitions. cyclomatic complexity: 13 Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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,443 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 55 states and 66 transitions. cyclomatic complexity: 13 Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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 1579 states and 2094 transitions. Complement of second has 348 states 49 powerset states299 rank states. The highest rank that occured is 5 [2024-10-12 00:18:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 27 states 6 stem states 18 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 80 transitions. [2024-10-12 00:18:09,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 80 transitions. Stem has 9 letters. Loop has 20 letters. [2024-10-12 00:18:09,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:09,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 80 transitions. Stem has 29 letters. Loop has 20 letters. [2024-10-12 00:18:09,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:09,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 80 transitions. Stem has 9 letters. Loop has 40 letters. [2024-10-12 00:18:09,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:09,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1579 states and 2094 transitions. [2024-10-12 00:18:09,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2024-10-12 00:18:09,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1579 states to 549 states and 767 transitions. [2024-10-12 00:18:09,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:18:09,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2024-10-12 00:18:09,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 767 transitions. [2024-10-12 00:18:09,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:09,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 549 states and 767 transitions. [2024-10-12 00:18:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 767 transitions. [2024-10-12 00:18:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 227. [2024-10-12 00:18:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 227 states have (on average 1.3171806167400881) internal successors, (299), 226 states have internal predecessors, (299), 0 states have call successors, (0), 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,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 299 transitions. [2024-10-12 00:18:09,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 227 states and 299 transitions. [2024-10-12 00:18:09,476 INFO L425 stractBuchiCegarLoop]: Abstraction has 227 states and 299 transitions. [2024-10-12 00:18:09,477 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:18:09,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 299 transitions. [2024-10-12 00:18:09,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2024-10-12 00:18:09,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:09,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:09,478 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:09,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 1] [2024-10-12 00:18:09,479 INFO L745 eck$LassoCheckResult]: Stem: 6098#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6099#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 6107#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 6091#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 6090#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6104#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6125#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6163#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6205#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6109#L555-1 [2024-10-12 00:18:09,479 INFO L747 eck$LassoCheckResult]: Loop: 6109#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6094#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6095#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 6097#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6105#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6275#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6272#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6269#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6268#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6267#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6266#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6265#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6264#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6263#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6262#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6261#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6260#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6259#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6243#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6242#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6241#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6239#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6240#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6121#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6104#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 6125#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 6163#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 6205#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 6109#L555-1 [2024-10-12 00:18:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash -533019103, now seen corresponding path program 6 times [2024-10-12 00:18:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342312525] [2024-10-12 00:18:09,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -565870987, now seen corresponding path program 4 times [2024-10-12 00:18:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458901267] [2024-10-12 00:18:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:09,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2016924821, now seen corresponding path program 7 times [2024-10-12 00:18:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:09,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954668543] [2024-10-12 00:18:09,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:09,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:13,099 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:13,100 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:13,100 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:13,100 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:13,100 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:13,100 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:13,100 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:13,100 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:13,100 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration12_Lasso [2024-10-12 00:18:13,100 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:13,100 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:13,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:13,600 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-10-12 00:18:17,218 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:18:17,218 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:18:17,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,220 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:17,221 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:17,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:17,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:17,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:17,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,247 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:17,248 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:17,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:17,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:17,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:17,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,273 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:17,274 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:17,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:17,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:17,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:17,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,297 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:17,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,299 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:17,300 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:17,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:17,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:17,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:17,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,323 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:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,325 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:17,326 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:17,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:18:17,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:18:17,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:18:17,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,351 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:17,352 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:17,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,379 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:17,380 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:17,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,411 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:17,411 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:17,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,443 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:17,444 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:17,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,476 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:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,478 INFO L229 MonitoredProcess]: Starting monitored process 121 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:17,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-12 00:18:17,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-10-12 00:18:17,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,506 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:17,506 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:17,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:17,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,536 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:17,537 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:17,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,572 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:17,573 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:17,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:17,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:18:17,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:18:17,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:18:17,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:18:17,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:17,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,603 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:17,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:18:17,609 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:17,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:18:17,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:18:17,617 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2024-10-12 00:18:17,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:18:17,634 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2024-10-12 00:18:17,634 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2024-10-12 00:18:17,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:18:17,945 INFO L443 ModelExtractionUtils]: Simplification made 46 calls to the SMT solver. [2024-10-12 00:18:17,945 INFO L444 ModelExtractionUtils]: 11 out of 50 variables were initially zero. Simplification set additionally 31 variables to zero. [2024-10-12 00:18:17,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:17,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:18:17,948 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:17,949 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:17,950 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:18:17,966 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 6. [2024-10-12 00:18:17,966 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:18:17,966 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_8) = 1*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~tmp~0#1.base) ULTIMATE.start_main_~tmp~0#1.offset)_8 Supporting invariants [19*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) ULTIMATE.start_main_~maxId~0#1.offset)_8 - 18*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) ULTIMATE.start_main_~id~0#1.offset)_8 >= 0, 1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) 0)_4 >= 0, -1*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~id~0#1.base) 0)_4 + 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~maxId~0#1.base) 0)_2 - 2 >= 0] [2024-10-12 00:18:17,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-10-12 00:18:18,060 INFO L156 tatePredicateManager]: 22 out of 26 supporting invariants were superfluous and have been removed [2024-10-12 00:18:18,066 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-12 00:18:18,066 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-12 00:18:18,066 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~tmp~0!base,]]] [2024-10-12 00:18:18,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:18,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:18:18,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:18,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:18,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:18,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:18,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:18,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 00:18:18,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:18,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:18:18,435 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:18,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:18,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:18,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:19,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:19,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:19,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:19,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 20 loop predicates [2024-10-12 00:18:19,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79 Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:19,781 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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) Result 229 states and 301 transitions. Complement of second has 6 states. [2024-10-12 00:18:19,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2024-10-12 00:18:19,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 9 letters. Loop has 28 letters. [2024-10-12 00:18:19,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:19,782 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:19,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:18:19,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:19,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:19,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:19,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:19,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:20,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 00:18:20,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:20,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:18:20,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:20,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:20,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:20,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:21,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:21,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:21,362 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 20 loop predicates [2024-10-12 00:18:21,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79 Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:21,425 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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) Result 229 states and 301 transitions. Complement of second has 6 states. [2024-10-12 00:18:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-12 00:18:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2024-10-12 00:18:21,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 9 letters. Loop has 28 letters. [2024-10-12 00:18:21,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:21,431 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:21,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:21,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:18:21,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:21,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:21,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:21,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:21,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 00:18:21,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:21,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:18:21,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:22,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:22,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:22,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:22,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:22,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:23,051 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 20 loop predicates [2024-10-12 00:18:23,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79 Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:23,207 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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) Result 354 states and 437 transitions. Complement of second has 14 states. [2024-10-12 00:18:23,207 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:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2024-10-12 00:18:23,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 9 letters. Loop has 28 letters. [2024-10-12 00:18:23,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:23,208 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:23,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:23,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:18:23,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:23,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:23,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:23,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:23,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 00:18:23,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:23,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:18:23,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:23,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:24,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:24,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:24,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:24,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:24,694 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 20 loop predicates [2024-10-12 00:18:24,694 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79 Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:24,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 227 states and 299 transitions. cyclomatic complexity: 79. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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) Result 354 states and 438 transitions. Complement of second has 14 states. [2024-10-12 00:18:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2024-10-12 00:18:24,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 19 transitions. Stem has 9 letters. Loop has 28 letters. [2024-10-12 00:18:24,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:24,876 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-12 00:18:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:24,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 00:18:24,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:24,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-12 00:18:24,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-12 00:18:25,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-12 00:18:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:18:25,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 00:18:25,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:18:25,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-12 00:18:25,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:25,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:25,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:25,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:26,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:26,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-12 00:18:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:18:26,299 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.6 stem predicates 20 loop predicates [2024-10-12 00:18:26,299 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 227 states and 299 transitions. cyclomatic complexity: 79 Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:27,617 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 227 states and 299 transitions. cyclomatic complexity: 79 Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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) Result 6418 states and 9323 transitions. Complement of second has 472 states 65 powerset states407 rank states. The highest rank that occured is 5 [2024-10-12 00:18:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 35 states 6 stem states 26 non-accepting loop states 2 accepting loop states [2024-10-12 00:18:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 96 transitions. [2024-10-12 00:18:27,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 96 transitions. Stem has 9 letters. Loop has 28 letters. [2024-10-12 00:18:27,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:27,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 96 transitions. Stem has 37 letters. Loop has 28 letters. [2024-10-12 00:18:27,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:27,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 96 transitions. Stem has 9 letters. Loop has 56 letters. [2024-10-12 00:18:27,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:18:27,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6418 states and 9323 transitions. [2024-10-12 00:18:27,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2024-10-12 00:18:27,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6418 states to 1810 states and 2689 transitions. [2024-10-12 00:18:27,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:18:27,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2024-10-12 00:18:27,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1810 states and 2689 transitions. [2024-10-12 00:18:27,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:18:27,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1810 states and 2689 transitions. [2024-10-12 00:18:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states and 2689 transitions. [2024-10-12 00:18:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 577. [2024-10-12 00:18:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 577 states have (on average 1.4540727902946273) internal successors, (839), 576 states have internal predecessors, (839), 0 states have call successors, (0), 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:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 839 transitions. [2024-10-12 00:18:27,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 577 states and 839 transitions. [2024-10-12 00:18:27,709 INFO L425 stractBuchiCegarLoop]: Abstraction has 577 states and 839 transitions. [2024-10-12 00:18:27,709 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:18:27,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 577 states and 839 transitions. [2024-10-12 00:18:27,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2024-10-12 00:18:27,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:18:27,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:18:27,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:18:27,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 9, 8, 1] [2024-10-12 00:18:27,713 INFO L745 eck$LassoCheckResult]: Stem: 15284#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15285#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~mem17#1, main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~id~0#1.base, main_~id~0#1.offset, main_~maxId~0#1.base, main_~maxId~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~id~0#1.base, main_~id~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~maxId~0#1.base, main_~maxId~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~id~0#1.base, main_~id~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);havoc main_#t~nondet5#1;call main_#t~mem6#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short9#1 := 0 <= main_#t~mem6#1; 15297#L552 assume main_#t~short9#1;call main_#t~mem7#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call main_#t~mem8#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4);main_#t~short9#1 := main_#t~mem7#1 < main_#t~mem8#1; 15399#L552-2 assume main_#t~short9#1;havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4);main_~tmp~0#1.base, main_~tmp~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);call write~int#2(1 + main_#t~mem11#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem11#1; 15447#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15395#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15445#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15389#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15533#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15299#L555-1 [2024-10-12 00:18:27,713 INFO L747 eck$LassoCheckResult]: Loop: 15299#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15300#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15846#L556 assume !(main_#t~mem16#1 < main_#t~mem17#1);havoc main_#t~mem16#1;havoc main_#t~mem17#1;call write~int#2(0, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4); 15845#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15301#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15302#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15708#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15709#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15844#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15843#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15701#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15700#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15698#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15699#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15694#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15695#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15791#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15792#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15788#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15786#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15787#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15834#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15782#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15781#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15780#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15779#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15627#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15626#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15625#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15623#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15624#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15313#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15294#L555-1 assume main_#t~short15#1;havoc main_#t~nondet14#1;main_#t~short15#1 := 0 != main_#t~nondet14#1; 15318#L555-3 assume !!main_#t~short15#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~nondet14#1;havoc main_#t~short15#1;call main_#t~mem16#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem17#1 := read~int#0(main_~maxId~0#1.base, main_~maxId~0#1.offset, 4); 15389#L556 assume main_#t~mem16#1 < main_#t~mem17#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;call main_#t~mem18#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call write~int#2(1 + main_#t~mem18#1, main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);havoc main_#t~mem18#1; 15533#L556-2 call main_#t~mem12#1 := read~int#2(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem13#1 := read~int#1(main_~id~0#1.base, main_~id~0#1.offset, 4);main_#t~short15#1 := main_#t~mem12#1 != main_#t~mem13#1; 15299#L555-1 [2024-10-12 00:18:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash -533019103, now seen corresponding path program 7 times [2024-10-12 00:18:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978156309] [2024-10-12 00:18:27,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:27,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:27,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1186417495, now seen corresponding path program 5 times [2024-10-12 00:18:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148215806] [2024-10-12 00:18:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:27,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:27,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:18:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash -955061559, now seen corresponding path program 8 times [2024-10-12 00:18:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:18:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122581661] [2024-10-12 00:18:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:18:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:18:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:27,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:18:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:18:27,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:18:35,155 WARN L286 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 318 DAG size of output: 243 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-12 00:18:35,944 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:18:35,944 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:18:35,944 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:18:35,944 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:18:35,944 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:18:35,944 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:18:35,945 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:18:35,945 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:18:35,945 INFO L132 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca-2.i_Iteration13_Lasso [2024-10-12 00:18:35,945 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:18:35,945 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:18:35,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:35,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:36,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:36,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:36,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:18:36,449 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10