./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:51:16,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:51:16,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:51:16,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:51:16,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:51:16,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:51:16,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:51:16,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:51:16,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:51:16,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:51:16,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:51:16,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:51:16,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:51:16,300 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:51:16,302 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:51:16,302 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:51:16,302 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:51:16,303 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:51:16,303 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:51:16,303 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:51:16,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:51:16,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:51:16,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:51:16,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:51:16,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:51:16,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:51:16,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:51:16,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:51:16,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:51:16,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:51:16,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:51:16,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:51:16,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:51:16,309 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:51:16,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:51:16,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:51:16,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:51:16,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:51:16,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:51:16,310 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:51:16,310 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2024-11-17 08:51:16,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:51:16,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:51:16,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:51:16,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:51:16,561 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:51:16,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-17 08:51:17,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:51:18,027 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:51:18,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-17 08:51:18,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce56abc7/8808916e3e4542c3b31af90e8a768195/FLAGa5e47bc27 [2024-11-17 08:51:18,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce56abc7/8808916e3e4542c3b31af90e8a768195 [2024-11-17 08:51:18,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:51:18,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:51:18,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:51:18,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:51:18,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:51:18,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c60ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18, skipping insertion in model container [2024-11-17 08:51:18,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:51:18,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:51:18,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:51:18,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:51:18,651 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:51:18,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18 WrapperNode [2024-11-17 08:51:18,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:51:18,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:51:18,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:51:18,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:51:18,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,679 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-11-17 08:51:18,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:51:18,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:51:18,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:51:18,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:51:18,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,710 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2024-11-17 08:51:18,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:51:18,724 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:51:18,724 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:51:18,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:51:18,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (1/1) ... [2024-11-17 08:51:18,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:18,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:18,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:18,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:51:18,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 08:51:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-17 08:51:18,808 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-17 08:51:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-17 08:51:18,808 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-17 08:51:18,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:51:18,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:51:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:51:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:51:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:51:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 08:51:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-17 08:51:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-17 08:51:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:51:18,887 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:51:18,890 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:51:19,053 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2024-11-17 08:51:19,075 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-17 08:51:19,075 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:51:19,090 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:51:19,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:51:19,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:19 BoogieIcfgContainer [2024-11-17 08:51:19,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:51:19,093 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:51:19,093 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:51:19,096 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:51:19,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:19,097 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:51:18" (1/3) ... [2024-11-17 08:51:19,097 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66054887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:51:19, skipping insertion in model container [2024-11-17 08:51:19,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:19,097 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:51:18" (2/3) ... [2024-11-17 08:51:19,098 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66054887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:51:19, skipping insertion in model container [2024-11-17 08:51:19,098 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:51:19,098 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:19" (3/3) ... [2024-11-17 08:51:19,099 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-17 08:51:19,142 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:51:19,142 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:51:19,142 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:51:19,142 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:51:19,142 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:51:19,142 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:51:19,142 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:51:19,143 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:51:19,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 08:51:19,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:19,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:19,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:19,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:19,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:19,169 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:51:19,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 08:51:19,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:19,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:19,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:19,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:19,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:19,177 INFO L745 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 27#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 11#L86-1true call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 9#func_to_recursive_line_21_to_22_0ENTRYtrue [2024-11-17 08:51:19,178 INFO L747 eck$LassoCheckResult]: Loop: 9#func_to_recursive_line_21_to_22_0ENTRYtrue ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 16#L61true assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 32#L67-1true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 12#func_to_recursive_line_22_to_23_0ENTRYtrue ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 22#L41true assume !(#t~mem7 < 6);havoc #t~mem7; 18#func_to_recursive_line_22_to_23_0FINALtrue assume true; 28#func_to_recursive_line_22_to_23_0EXITtrue >#47#return; 30#L67true call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3#L72true call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 9#func_to_recursive_line_21_to_22_0ENTRYtrue [2024-11-17 08:51:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 1 times [2024-11-17 08:51:19,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:19,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126680214] [2024-11-17 08:51:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:19,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:19,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:19,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash 880373472, now seen corresponding path program 1 times [2024-11-17 08:51:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462609105] [2024-11-17 08:51:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:51:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:19,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462609105] [2024-11-17 08:51:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462609105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 08:51:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303162441] [2024-11-17 08:51:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:19,674 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:19,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:19,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 08:51:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 08:51:19,701 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 08:51:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:19,829 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-17 08:51:19,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2024-11-17 08:51:19,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:19,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 29 transitions. [2024-11-17 08:51:19,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:51:19,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:51:19,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2024-11-17 08:51:19,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:19,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-17 08:51:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2024-11-17 08:51:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-17 08:51:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-17 08:51:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-17 08:51:19,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-17 08:51:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:51:19,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-17 08:51:19,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:51:19,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-11-17 08:51:19,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:19,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:19,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:19,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:19,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:19,874 INFO L745 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 97#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 90#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 91#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:19,874 INFO L747 eck$LassoCheckResult]: Loop: 91#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 93#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 101#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 98#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 99#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 100#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 104#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 106#func_to_recursive_line_23_to_23_0FINAL assume true; 105#func_to_recursive_line_23_to_23_0EXIT >#41#return; 107#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 94#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 101#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 98#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 92#func_to_recursive_line_22_to_23_0FINAL assume true; 95#func_to_recursive_line_22_to_23_0EXIT >#39#return; 108#func_to_recursive_line_22_to_23_0FINAL assume true; 110#func_to_recursive_line_22_to_23_0EXIT >#47#return; 109#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 89#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 91#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:19,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 2 times [2024-11-17 08:51:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:19,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684846129] [2024-11-17 08:51:19,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:19,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:19,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:19,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:19,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1255189484, now seen corresponding path program 1 times [2024-11-17 08:51:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307093489] [2024-11-17 08:51:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 08:51:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 08:51:20,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:20,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307093489] [2024-11-17 08:51:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307093489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:51:20,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:51:20,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 08:51:20,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807015371] [2024-11-17 08:51:20,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:51:20,209 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:20,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:51:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:51:20,210 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 08:51:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:20,303 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-17 08:51:20,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-11-17 08:51:20,304 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:20,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2024-11-17 08:51:20,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:51:20,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:51:20,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-11-17 08:51:20,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:20,305 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-17 08:51:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-11-17 08:51:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-17 08:51:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:51:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-17 08:51:20,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-17 08:51:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:51:20,310 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-17 08:51:20,310 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:51:20,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-11-17 08:51:20,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:20,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:20,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:20,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:20,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:20,312 INFO L745 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 180#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 173#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 174#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:20,312 INFO L747 eck$LassoCheckResult]: Loop: 174#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 185#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 176#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 184#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 182#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 183#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 187#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 186#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 183#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 187#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 190#func_to_recursive_line_23_to_23_0FINAL assume true; 188#func_to_recursive_line_23_to_23_0EXIT >#37#return; 189#func_to_recursive_line_23_to_23_0FINAL assume true; 195#func_to_recursive_line_23_to_23_0EXIT >#41#return; 192#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 177#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 184#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 175#func_to_recursive_line_22_to_23_0FINAL assume true; 178#func_to_recursive_line_22_to_23_0EXIT >#39#return; 191#func_to_recursive_line_22_to_23_0FINAL assume true; 194#func_to_recursive_line_22_to_23_0EXIT >#47#return; 193#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 172#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 174#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:20,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 3 times [2024-11-17 08:51:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642740240] [2024-11-17 08:51:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:20,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:20,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -837946947, now seen corresponding path program 1 times [2024-11-17 08:51:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:20,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180888968] [2024-11-17 08:51:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 08:51:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 08:51:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180888968] [2024-11-17 08:51:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180888968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:51:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815319084] [2024-11-17 08:51:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:51:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:20,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:51:20,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 08:51:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:20,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 08:51:20,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:20,947 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-11-17 08:51:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 08:51:21,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:51:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:51:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815319084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:51:21,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:51:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-11-17 08:51:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479371466] [2024-11-17 08:51:21,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:51:21,477 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 08:51:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-17 08:51:21,479 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 25 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 10 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-17 08:51:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:21,861 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-17 08:51:21,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-11-17 08:51:21,862 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:21,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2024-11-17 08:51:21,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-17 08:51:21,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-17 08:51:21,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2024-11-17 08:51:21,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:21,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:51:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2024-11-17 08:51:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-17 08:51:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-17 08:51:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-17 08:51:21,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:51:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 08:51:21,867 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-17 08:51:21,867 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:51:21,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-11-17 08:51:21,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:21,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:21,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:21,868 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:21,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:21,869 INFO L745 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 460#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 453#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 454#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:21,869 INFO L747 eck$LassoCheckResult]: Loop: 454#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 465#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 456#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 466#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 462#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 464#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 468#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 467#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 464#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 468#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 467#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 464#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 468#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 471#func_to_recursive_line_23_to_23_0FINAL assume true; 469#func_to_recursive_line_23_to_23_0EXIT >#37#return; 470#func_to_recursive_line_23_to_23_0FINAL assume true; 475#func_to_recursive_line_23_to_23_0EXIT >#37#return; 479#func_to_recursive_line_23_to_23_0FINAL assume true; 478#func_to_recursive_line_23_to_23_0EXIT >#41#return; 473#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 457#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 466#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 461#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 462#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 464#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 468#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 467#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 464#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 468#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 467#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 464#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 468#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 471#func_to_recursive_line_23_to_23_0FINAL assume true; 469#func_to_recursive_line_23_to_23_0EXIT >#37#return; 470#func_to_recursive_line_23_to_23_0FINAL assume true; 475#func_to_recursive_line_23_to_23_0EXIT >#37#return; 479#func_to_recursive_line_23_to_23_0FINAL assume true; 478#func_to_recursive_line_23_to_23_0EXIT >#41#return; 473#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 457#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 466#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 461#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 463#func_to_recursive_line_22_to_23_0FINAL assume true; 472#func_to_recursive_line_22_to_23_0EXIT >#39#return; 455#func_to_recursive_line_22_to_23_0FINAL assume true; 458#func_to_recursive_line_22_to_23_0EXIT >#39#return; 477#func_to_recursive_line_22_to_23_0FINAL assume true; 476#func_to_recursive_line_22_to_23_0EXIT >#47#return; 474#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 452#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 454#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 4 times [2024-11-17 08:51:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:21,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023982961] [2024-11-17 08:51:21,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:21,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:21,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:21,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 364720792, now seen corresponding path program 2 times [2024-11-17 08:51:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063864071] [2024-11-17 08:51:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-17 08:51:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-17 08:51:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 08:51:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063864071] [2024-11-17 08:51:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063864071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:51:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108513294] [2024-11-17 08:51:22,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:51:22,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:51:22,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:22,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:51:22,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 08:51:22,909 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:51:22,910 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:51:22,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-17 08:51:22,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:22,951 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-11-17 08:51:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-17 08:51:23,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:51:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 08:51:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108513294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:51:23,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:51:23,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 30 [2024-11-17 08:51:23,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678121566] [2024-11-17 08:51:23,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:51:23,889 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:23,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-17 08:51:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-17 08:51:23,890 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 30 states, 22 states have (on average 2.227272727272727) internal successors, (49), 25 states have internal predecessors, (49), 10 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-17 08:51:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:24,187 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-17 08:51:24,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-11-17 08:51:24,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:24,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2024-11-17 08:51:24,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-17 08:51:24,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-17 08:51:24,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-11-17 08:51:24,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:24,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-17 08:51:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-11-17 08:51:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-17 08:51:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-17 08:51:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-17 08:51:24,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-17 08:51:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 08:51:24,195 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-17 08:51:24,195 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:51:24,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2024-11-17 08:51:24,195 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:24,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:24,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:24,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:24,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:24,198 INFO L745 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 996#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 989#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 990#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:24,198 INFO L747 eck$LassoCheckResult]: Loop: 990#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 1001#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 993#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1000#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 997#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 998#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1006#func_to_recursive_line_23_to_23_0FINAL assume true; 1004#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1005#func_to_recursive_line_23_to_23_0FINAL assume true; 1019#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1018#func_to_recursive_line_23_to_23_0FINAL assume true; 1017#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1016#func_to_recursive_line_23_to_23_0FINAL assume true; 1015#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1013#func_to_recursive_line_23_to_23_0FINAL assume true; 1012#func_to_recursive_line_23_to_23_0EXIT >#41#return; 1008#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 992#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1000#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 997#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 998#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1002#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 999#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1003#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1006#func_to_recursive_line_23_to_23_0FINAL assume true; 1004#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1005#func_to_recursive_line_23_to_23_0FINAL assume true; 1019#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1018#func_to_recursive_line_23_to_23_0FINAL assume true; 1017#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1016#func_to_recursive_line_23_to_23_0FINAL assume true; 1015#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1013#func_to_recursive_line_23_to_23_0FINAL assume true; 1012#func_to_recursive_line_23_to_23_0EXIT >#41#return; 1008#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 992#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1000#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 997#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 991#func_to_recursive_line_22_to_23_0FINAL assume true; 994#func_to_recursive_line_22_to_23_0EXIT >#39#return; 1007#func_to_recursive_line_22_to_23_0FINAL assume true; 1014#func_to_recursive_line_22_to_23_0EXIT >#39#return; 1011#func_to_recursive_line_22_to_23_0FINAL assume true; 1010#func_to_recursive_line_22_to_23_0EXIT >#47#return; 1009#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 988#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 990#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 5 times [2024-11-17 08:51:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399430480] [2024-11-17 08:51:24,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:24,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:24,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:24,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash 493017176, now seen corresponding path program 3 times [2024-11-17 08:51:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:24,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492544051] [2024-11-17 08:51:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-17 08:51:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-17 08:51:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 118 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-17 08:51:25,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492544051] [2024-11-17 08:51:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492544051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:51:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099267082] [2024-11-17 08:51:25,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:51:25,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:51:25,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:25,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:51:25,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 08:51:25,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-17 08:51:25,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:51:25,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-17 08:51:25,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:25,591 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-11-17 08:51:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-11-17 08:51:25,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:51:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-17 08:51:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099267082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:51:26,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:51:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 33 [2024-11-17 08:51:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385052529] [2024-11-17 08:51:26,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:51:26,411 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-17 08:51:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2024-11-17 08:51:26,413 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 33 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 12 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-17 08:51:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:26,800 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-17 08:51:26,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-11-17 08:51:26,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:26,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2024-11-17 08:51:26,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-17 08:51:26,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-17 08:51:26,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2024-11-17 08:51:26,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:26,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-17 08:51:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2024-11-17 08:51:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 08:51:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-17 08:51:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-17 08:51:26,805 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-17 08:51:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 08:51:26,806 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-17 08:51:26,806 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:51:26,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2024-11-17 08:51:26,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:26,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:26,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:26,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:26,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:26,808 INFO L745 eck$LassoCheckResult]: Stem: 1788#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1789#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1782#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 1783#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:26,808 INFO L747 eck$LassoCheckResult]: Loop: 1783#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 1794#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 1785#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1793#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 1790#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1791#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1799#func_to_recursive_line_23_to_23_0FINAL assume true; 1797#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1798#func_to_recursive_line_23_to_23_0FINAL assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1815#func_to_recursive_line_23_to_23_0FINAL assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1813#func_to_recursive_line_23_to_23_0FINAL assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1810#func_to_recursive_line_23_to_23_0FINAL assume true; 1807#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1806#func_to_recursive_line_23_to_23_0FINAL assume true; 1805#func_to_recursive_line_23_to_23_0EXIT >#41#return; 1801#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1786#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1793#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 1790#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1791#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1799#func_to_recursive_line_23_to_23_0FINAL assume true; 1797#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1798#func_to_recursive_line_23_to_23_0FINAL assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1815#func_to_recursive_line_23_to_23_0FINAL assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1813#func_to_recursive_line_23_to_23_0FINAL assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1810#func_to_recursive_line_23_to_23_0FINAL assume true; 1807#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1806#func_to_recursive_line_23_to_23_0FINAL assume true; 1805#func_to_recursive_line_23_to_23_0EXIT >#41#return; 1801#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1786#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1793#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 1790#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1791#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1795#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1792#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1796#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1799#func_to_recursive_line_23_to_23_0FINAL assume true; 1797#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1798#func_to_recursive_line_23_to_23_0FINAL assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1815#func_to_recursive_line_23_to_23_0FINAL assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1813#func_to_recursive_line_23_to_23_0FINAL assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1810#func_to_recursive_line_23_to_23_0FINAL assume true; 1807#func_to_recursive_line_23_to_23_0EXIT >#37#return; 1806#func_to_recursive_line_23_to_23_0FINAL assume true; 1805#func_to_recursive_line_23_to_23_0EXIT >#41#return; 1801#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1786#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1793#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 1790#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1784#func_to_recursive_line_22_to_23_0FINAL assume true; 1787#func_to_recursive_line_22_to_23_0EXIT >#39#return; 1800#func_to_recursive_line_22_to_23_0FINAL assume true; 1811#func_to_recursive_line_22_to_23_0EXIT >#39#return; 1809#func_to_recursive_line_22_to_23_0FINAL assume true; 1808#func_to_recursive_line_22_to_23_0EXIT >#39#return; 1804#func_to_recursive_line_22_to_23_0FINAL assume true; 1803#func_to_recursive_line_22_to_23_0EXIT >#47#return; 1802#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1781#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1783#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:26,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 6 times [2024-11-17 08:51:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:26,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902312478] [2024-11-17 08:51:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:26,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:26,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 877996867, now seen corresponding path program 4 times [2024-11-17 08:51:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536968819] [2024-11-17 08:51:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-17 08:51:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-17 08:51:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-17 08:51:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-17 08:51:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536968819] [2024-11-17 08:51:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536968819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:51:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733422647] [2024-11-17 08:51:28,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:51:28,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:51:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:28,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:51:28,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 08:51:29,047 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:51:29,047 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:51:29,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-17 08:51:29,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:29,078 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-11-17 08:51:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-17 08:51:29,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:51:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-17 08:51:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733422647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:51:31,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:51:31,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 26] total 45 [2024-11-17 08:51:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275653766] [2024-11-17 08:51:31,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:51:31,133 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-17 08:51:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2024-11-17 08:51:31,135 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand has 45 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 37 states have internal predecessors, (61), 13 states have call successors, (25), 10 states have call predecessors, (25), 15 states have return successors, (26), 13 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-17 08:51:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:31,550 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-17 08:51:31,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-11-17 08:51:31,551 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:31,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 42 transitions. [2024-11-17 08:51:31,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-17 08:51:31,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-17 08:51:31,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2024-11-17 08:51:31,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:31,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-17 08:51:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2024-11-17 08:51:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-17 08:51:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-17 08:51:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-17 08:51:31,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-17 08:51:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 08:51:31,561 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-17 08:51:31,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:51:31,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-11-17 08:51:31,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:31,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:31,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:31,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:31,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:31,563 INFO L745 eck$LassoCheckResult]: Stem: 3153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3154#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3147#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 3148#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:31,564 INFO L747 eck$LassoCheckResult]: Loop: 3148#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 3159#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 3151#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3158#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 3155#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3156#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3164#func_to_recursive_line_23_to_23_0FINAL assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3163#func_to_recursive_line_23_to_23_0FINAL assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3182#func_to_recursive_line_23_to_23_0FINAL assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3180#func_to_recursive_line_23_to_23_0FINAL assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3178#func_to_recursive_line_23_to_23_0FINAL assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3176#func_to_recursive_line_23_to_23_0FINAL assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3171#func_to_recursive_line_23_to_23_0FINAL assume true; 3170#func_to_recursive_line_23_to_23_0EXIT >#41#return; 3166#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3150#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3158#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 3155#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3156#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3164#func_to_recursive_line_23_to_23_0FINAL assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3163#func_to_recursive_line_23_to_23_0FINAL assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3182#func_to_recursive_line_23_to_23_0FINAL assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3180#func_to_recursive_line_23_to_23_0FINAL assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3178#func_to_recursive_line_23_to_23_0FINAL assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3176#func_to_recursive_line_23_to_23_0FINAL assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3171#func_to_recursive_line_23_to_23_0FINAL assume true; 3170#func_to_recursive_line_23_to_23_0EXIT >#41#return; 3166#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3150#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3158#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 3155#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3156#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3160#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3157#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3164#func_to_recursive_line_23_to_23_0FINAL assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3163#func_to_recursive_line_23_to_23_0FINAL assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3182#func_to_recursive_line_23_to_23_0FINAL assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3180#func_to_recursive_line_23_to_23_0FINAL assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3178#func_to_recursive_line_23_to_23_0FINAL assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3176#func_to_recursive_line_23_to_23_0FINAL assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#37#return; 3171#func_to_recursive_line_23_to_23_0FINAL assume true; 3170#func_to_recursive_line_23_to_23_0EXIT >#41#return; 3166#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3150#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3158#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 3155#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3149#func_to_recursive_line_22_to_23_0FINAL assume true; 3152#func_to_recursive_line_22_to_23_0EXIT >#39#return; 3165#func_to_recursive_line_22_to_23_0FINAL assume true; 3174#func_to_recursive_line_22_to_23_0EXIT >#39#return; 3173#func_to_recursive_line_22_to_23_0FINAL assume true; 3172#func_to_recursive_line_22_to_23_0EXIT >#39#return; 3169#func_to_recursive_line_22_to_23_0FINAL assume true; 3168#func_to_recursive_line_22_to_23_0EXIT >#47#return; 3167#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3146#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 3148#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 7 times [2024-11-17 08:51:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716656414] [2024-11-17 08:51:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:31,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:31,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:31,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1666695850, now seen corresponding path program 5 times [2024-11-17 08:51:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227832234] [2024-11-17 08:51:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2024-11-17 08:51:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227832234] [2024-11-17 08:51:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227832234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:51:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013186962] [2024-11-17 08:51:33,311 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:51:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:51:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:33,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:51:33,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 08:51:33,712 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-17 08:51:33,713 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:51:33,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 08:51:33,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:33,730 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-11-17 08:51:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-11-17 08:51:33,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:51:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-17 08:51:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013186962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:51:34,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:51:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 37 [2024-11-17 08:51:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357052796] [2024-11-17 08:51:34,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:51:34,775 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-17 08:51:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2024-11-17 08:51:34,776 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand has 37 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 30 states have internal predecessors, (43), 16 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-17 08:51:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:35,062 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-17 08:51:35,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. [2024-11-17 08:51:35,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:35,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 46 transitions. [2024-11-17 08:51:35,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-17 08:51:35,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-17 08:51:35,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2024-11-17 08:51:35,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:35,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-17 08:51:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2024-11-17 08:51:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-17 08:51:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-17 08:51:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-17 08:51:35,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-17 08:51:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 08:51:35,075 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-17 08:51:35,075 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:51:35,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2024-11-17 08:51:35,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:35,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:35,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:35,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:35,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:35,078 INFO L745 eck$LassoCheckResult]: Stem: 4734#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4735#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4728#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 4729#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:35,079 INFO L747 eck$LassoCheckResult]: Loop: 4729#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 4739#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 4731#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 4736#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4737#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#func_to_recursive_line_23_to_23_0FINAL assume true; 4743#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4744#func_to_recursive_line_23_to_23_0FINAL assume true; 4768#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4767#func_to_recursive_line_23_to_23_0FINAL assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4764#func_to_recursive_line_23_to_23_0FINAL assume true; 4761#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4759#func_to_recursive_line_23_to_23_0FINAL assume true; 4758#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4756#func_to_recursive_line_23_to_23_0FINAL assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4752#func_to_recursive_line_23_to_23_0FINAL assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#41#return; 4747#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4732#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 4736#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4737#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#func_to_recursive_line_23_to_23_0FINAL assume true; 4743#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4744#func_to_recursive_line_23_to_23_0FINAL assume true; 4768#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4767#func_to_recursive_line_23_to_23_0FINAL assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4764#func_to_recursive_line_23_to_23_0FINAL assume true; 4761#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4759#func_to_recursive_line_23_to_23_0FINAL assume true; 4758#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4756#func_to_recursive_line_23_to_23_0FINAL assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4752#func_to_recursive_line_23_to_23_0FINAL assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#41#return; 4747#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4732#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 4736#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4737#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#func_to_recursive_line_23_to_23_0FINAL assume true; 4743#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4744#func_to_recursive_line_23_to_23_0FINAL assume true; 4768#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4767#func_to_recursive_line_23_to_23_0FINAL assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4764#func_to_recursive_line_23_to_23_0FINAL assume true; 4761#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4759#func_to_recursive_line_23_to_23_0FINAL assume true; 4758#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4756#func_to_recursive_line_23_to_23_0FINAL assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4752#func_to_recursive_line_23_to_23_0FINAL assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#41#return; 4747#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4732#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 4736#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4737#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#func_to_recursive_line_23_to_23_0FINAL assume true; 4743#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4744#func_to_recursive_line_23_to_23_0FINAL assume true; 4768#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4767#func_to_recursive_line_23_to_23_0FINAL assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4764#func_to_recursive_line_23_to_23_0FINAL assume true; 4761#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4759#func_to_recursive_line_23_to_23_0FINAL assume true; 4758#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4756#func_to_recursive_line_23_to_23_0FINAL assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4752#func_to_recursive_line_23_to_23_0FINAL assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#41#return; 4747#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4732#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 4736#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4737#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4741#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4738#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#func_to_recursive_line_23_to_23_0FINAL assume true; 4743#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4744#func_to_recursive_line_23_to_23_0FINAL assume true; 4768#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4767#func_to_recursive_line_23_to_23_0FINAL assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4764#func_to_recursive_line_23_to_23_0FINAL assume true; 4761#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4759#func_to_recursive_line_23_to_23_0FINAL assume true; 4758#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4756#func_to_recursive_line_23_to_23_0FINAL assume true; 4753#func_to_recursive_line_23_to_23_0EXIT >#37#return; 4752#func_to_recursive_line_23_to_23_0FINAL assume true; 4751#func_to_recursive_line_23_to_23_0EXIT >#41#return; 4747#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4732#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 4736#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4730#func_to_recursive_line_22_to_23_0FINAL assume true; 4733#func_to_recursive_line_22_to_23_0EXIT >#39#return; 4746#func_to_recursive_line_22_to_23_0FINAL assume true; 4765#func_to_recursive_line_22_to_23_0EXIT >#39#return; 4763#func_to_recursive_line_22_to_23_0FINAL assume true; 4762#func_to_recursive_line_22_to_23_0EXIT >#39#return; 4760#func_to_recursive_line_22_to_23_0FINAL assume true; 4757#func_to_recursive_line_22_to_23_0EXIT >#39#return; 4755#func_to_recursive_line_22_to_23_0FINAL assume true; 4754#func_to_recursive_line_22_to_23_0EXIT >#39#return; 4750#func_to_recursive_line_22_to_23_0FINAL assume true; 4749#func_to_recursive_line_22_to_23_0EXIT >#47#return; 4748#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 4727#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 4729#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:35,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 8 times [2024-11-17 08:51:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:35,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997858130] [2024-11-17 08:51:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:35,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:35,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1452188514, now seen corresponding path program 6 times [2024-11-17 08:51:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797751459] [2024-11-17 08:51:35,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:51:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-17 08:51:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-11-17 08:51:39,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:51:39,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797751459] [2024-11-17 08:51:39,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797751459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:51:39,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773360380] [2024-11-17 08:51:39,158 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:51:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:51:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:39,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:51:39,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 08:51:42,687 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2024-11-17 08:51:42,687 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:51:42,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-17 08:51:42,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:42,715 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-11-17 08:51:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-11-17 08:51:42,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:51:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-11-17 08:51:44,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773360380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:51:44,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:51:44,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 26] total 46 [2024-11-17 08:51:44,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161328550] [2024-11-17 08:51:44,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:51:44,584 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:51:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:51:44,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-17 08:51:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1693, Unknown=0, NotChecked=0, Total=2070 [2024-11-17 08:51:44,585 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand has 46 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 19 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-11-17 08:51:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:51:44,939 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-17 08:51:44,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2024-11-17 08:51:44,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:44,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions. [2024-11-17 08:51:44,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-17 08:51:44,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-17 08:51:44,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2024-11-17 08:51:44,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:51:44,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-17 08:51:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2024-11-17 08:51:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-17 08:51:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-17 08:51:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-11-17 08:51:44,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-17 08:51:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 08:51:44,945 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-17 08:51:44,945 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:51:44,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2024-11-17 08:51:44,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:51:44,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:44,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:44,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:51:44,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:44,948 INFO L745 eck$LassoCheckResult]: Stem: 7467#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 7468#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 7461#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 7462#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:44,949 INFO L747 eck$LassoCheckResult]: Loop: 7462#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 7473#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 7464#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7470#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7478#func_to_recursive_line_23_to_23_0FINAL assume true; 7476#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7477#func_to_recursive_line_23_to_23_0FINAL assume true; 7503#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7502#func_to_recursive_line_23_to_23_0FINAL assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7498#func_to_recursive_line_23_to_23_0FINAL assume true; 7497#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7495#func_to_recursive_line_23_to_23_0FINAL assume true; 7492#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7490#func_to_recursive_line_23_to_23_0FINAL assume true; 7489#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7485#func_to_recursive_line_23_to_23_0FINAL assume true; 7484#func_to_recursive_line_23_to_23_0EXIT >#41#return; 7480#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7465#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7470#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7478#func_to_recursive_line_23_to_23_0FINAL assume true; 7476#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7477#func_to_recursive_line_23_to_23_0FINAL assume true; 7503#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7502#func_to_recursive_line_23_to_23_0FINAL assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7498#func_to_recursive_line_23_to_23_0FINAL assume true; 7497#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7495#func_to_recursive_line_23_to_23_0FINAL assume true; 7492#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7490#func_to_recursive_line_23_to_23_0FINAL assume true; 7489#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7485#func_to_recursive_line_23_to_23_0FINAL assume true; 7484#func_to_recursive_line_23_to_23_0EXIT >#41#return; 7480#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7465#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7470#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7478#func_to_recursive_line_23_to_23_0FINAL assume true; 7476#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7477#func_to_recursive_line_23_to_23_0FINAL assume true; 7503#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7502#func_to_recursive_line_23_to_23_0FINAL assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7498#func_to_recursive_line_23_to_23_0FINAL assume true; 7497#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7495#func_to_recursive_line_23_to_23_0FINAL assume true; 7492#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7490#func_to_recursive_line_23_to_23_0FINAL assume true; 7489#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7485#func_to_recursive_line_23_to_23_0FINAL assume true; 7484#func_to_recursive_line_23_to_23_0EXIT >#41#return; 7480#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7465#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7470#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7478#func_to_recursive_line_23_to_23_0FINAL assume true; 7476#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7477#func_to_recursive_line_23_to_23_0FINAL assume true; 7503#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7502#func_to_recursive_line_23_to_23_0FINAL assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7498#func_to_recursive_line_23_to_23_0FINAL assume true; 7497#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7495#func_to_recursive_line_23_to_23_0FINAL assume true; 7492#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7490#func_to_recursive_line_23_to_23_0FINAL assume true; 7489#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7485#func_to_recursive_line_23_to_23_0FINAL assume true; 7484#func_to_recursive_line_23_to_23_0EXIT >#41#return; 7480#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7465#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7470#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7478#func_to_recursive_line_23_to_23_0FINAL assume true; 7476#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7477#func_to_recursive_line_23_to_23_0FINAL assume true; 7503#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7502#func_to_recursive_line_23_to_23_0FINAL assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7498#func_to_recursive_line_23_to_23_0FINAL assume true; 7497#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7495#func_to_recursive_line_23_to_23_0FINAL assume true; 7492#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7490#func_to_recursive_line_23_to_23_0FINAL assume true; 7489#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7485#func_to_recursive_line_23_to_23_0FINAL assume true; 7484#func_to_recursive_line_23_to_23_0EXIT >#41#return; 7480#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7465#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7470#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7474#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7471#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7475#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7478#func_to_recursive_line_23_to_23_0FINAL assume true; 7476#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7477#func_to_recursive_line_23_to_23_0FINAL assume true; 7503#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7502#func_to_recursive_line_23_to_23_0FINAL assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7498#func_to_recursive_line_23_to_23_0FINAL assume true; 7497#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7495#func_to_recursive_line_23_to_23_0FINAL assume true; 7492#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7490#func_to_recursive_line_23_to_23_0FINAL assume true; 7489#func_to_recursive_line_23_to_23_0EXIT >#37#return; 7485#func_to_recursive_line_23_to_23_0FINAL assume true; 7484#func_to_recursive_line_23_to_23_0EXIT >#41#return; 7480#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7465#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7472#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 7469#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7463#func_to_recursive_line_22_to_23_0FINAL assume true; 7466#func_to_recursive_line_22_to_23_0EXIT >#39#return; 7479#func_to_recursive_line_22_to_23_0FINAL assume true; 7501#func_to_recursive_line_22_to_23_0EXIT >#39#return; 7499#func_to_recursive_line_22_to_23_0FINAL assume true; 7496#func_to_recursive_line_22_to_23_0EXIT >#39#return; 7494#func_to_recursive_line_22_to_23_0FINAL assume true; 7493#func_to_recursive_line_22_to_23_0EXIT >#39#return; 7491#func_to_recursive_line_22_to_23_0FINAL assume true; 7488#func_to_recursive_line_22_to_23_0EXIT >#39#return; 7487#func_to_recursive_line_22_to_23_0FINAL assume true; 7486#func_to_recursive_line_22_to_23_0EXIT >#39#return; 7483#func_to_recursive_line_22_to_23_0FINAL assume true; 7482#func_to_recursive_line_22_to_23_0EXIT >#47#return; 7481#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 7460#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 7462#func_to_recursive_line_21_to_22_0ENTRY [2024-11-17 08:51:44,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash 56586, now seen corresponding path program 9 times [2024-11-17 08:51:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:44,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367677045] [2024-11-17 08:51:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:44,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:44,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:44,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:44,960 INFO L85 PathProgramCache]: Analyzing trace with hash -791636088, now seen corresponding path program 7 times [2024-11-17 08:51:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671832354] [2024-11-17 08:51:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:45,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:45,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:45,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -398289569, now seen corresponding path program 1 times [2024-11-17 08:51:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455818147] [2024-11-17 08:51:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:45,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:45,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:53,630 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:51:53,631 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:51:53,631 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:51:53,631 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:51:53,631 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:51:53,631 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:53,631 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:51:53,631 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:51:53,631 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration9_Lasso [2024-11-17 08:51:53,631 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:51:53,631 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:51:53,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:53,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:51:54,538 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:51:54,541 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:51:54,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:51:54,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:51:54,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:51:54,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:54,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:51:54,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:51:54,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:51:54,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:51:54,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:51:54,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:51:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,715 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:51:54,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-11-17 08:51:54,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:54,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,744 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:51:54,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:51:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,774 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:51:54,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:51:54,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,803 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:51:54,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:51:54,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,832 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:51:54,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:51:54,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:51:54,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:51:54,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:51:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,866 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:51:54,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-11-17 08:51:54,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:51:54,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:51:54,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:51:54,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,900 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:51:54,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:51:54,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:51:54,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:51:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,934 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:51:54,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:51:54,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:51:54,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:51:54,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:54,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,967 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-17 08:51:54,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:51:54,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:51:54,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:51:54,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:51:54,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:51:54,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:51:54,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:51:54,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:51:54,992 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-17 08:51:54,992 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-17 08:51:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:51:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:51:54,995 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:51:54,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:51:55,000 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:51:55,011 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:51:55,011 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:51:55,012 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1 + 11 Supporting invariants [] [2024-11-17 08:51:55,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:51:55,071 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2024-11-17 08:51:55,077 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 08:51:55,078 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-17 08:51:55,078 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-17 08:51:55,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:55,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:51:55,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:51:55,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-17 08:51:55,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:51:56,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-17 08:51:57,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2024-11-17 08:51:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2024-11-17 08:51:57,143 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-17 08:51:57,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 08:51:57,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 131 states and 145 transitions. Complement of second has 19 states. [2024-11-17 08:51:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-17 08:51:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 08:51:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-17 08:51:57,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2024-11-17 08:51:57,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:51:57,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2024-11-17 08:51:57,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:51:57,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2024-11-17 08:51:57,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:51:57,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2024-11-17 08:51:57,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-17 08:51:57,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2024-11-17 08:51:57,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-17 08:51:57,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-17 08:51:57,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2024-11-17 08:51:57,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:51:57,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-17 08:51:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2024-11-17 08:51:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-11-17 08:51:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 21 states have return successors, (25), 22 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-17 08:51:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-17 08:51:57,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-17 08:51:57,335 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-17 08:51:57,335 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:51:57,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2024-11-17 08:51:57,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-17 08:51:57,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:51:57,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:51:57,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:51:57,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:51:57,337 INFO L745 eck$LassoCheckResult]: Stem: 8531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 8532#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8525#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 8543#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 8545#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 8534#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8541#func_to_recursive_line_22_to_23_0ENTRY [2024-11-17 08:51:57,337 INFO L747 eck$LassoCheckResult]: Loop: 8541#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 8533#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 8535#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8546#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8546#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8546#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8546#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8546#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8546#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8539#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8547#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8555#func_to_recursive_line_23_to_23_0FINAL assume true; 8551#func_to_recursive_line_23_to_23_0EXIT >#37#return; 8552#func_to_recursive_line_23_to_23_0FINAL assume true; 8586#func_to_recursive_line_23_to_23_0EXIT >#37#return; 8585#func_to_recursive_line_23_to_23_0FINAL assume true; 8584#func_to_recursive_line_23_to_23_0EXIT >#37#return; 8583#func_to_recursive_line_23_to_23_0FINAL assume true; 8582#func_to_recursive_line_23_to_23_0EXIT >#37#return; 8581#func_to_recursive_line_23_to_23_0FINAL assume true; 8580#func_to_recursive_line_23_to_23_0EXIT >#37#return; 8579#func_to_recursive_line_23_to_23_0FINAL assume true; 8578#func_to_recursive_line_23_to_23_0EXIT >#37#return; 8577#func_to_recursive_line_23_to_23_0FINAL assume true; 8576#func_to_recursive_line_23_to_23_0EXIT >#41#return; 8558#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 8536#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8541#func_to_recursive_line_22_to_23_0ENTRY [2024-11-17 08:51:57,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1685787238, now seen corresponding path program 1 times [2024-11-17 08:51:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474318331] [2024-11-17 08:51:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:57,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:57,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1356371725, now seen corresponding path program 1 times [2024-11-17 08:51:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436780749] [2024-11-17 08:51:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:57,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:57,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:51:57,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:51:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 794350, now seen corresponding path program 1 times [2024-11-17 08:51:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:51:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842805605] [2024-11-17 08:51:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:51:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:51:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:57,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:51:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:51:57,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:00,141 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:00,141 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:00,141 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:00,141 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:00,141 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:52:00,141 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,141 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:00,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:00,141 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2024-11-17 08:52:00,141 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:00,141 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:00,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:00,908 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:00,908 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:52:00,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,910 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:52:00,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:00,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:00,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:00,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:00,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:00,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:00,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:00,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:00,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:00,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:52:00,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,939 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:52:00,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:00,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:00,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:00,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:00,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:00,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:00,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:00,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:00,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:00,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-17 08:52:00,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,965 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:52:00,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:00,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:00,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:00,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:00,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:00,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:00,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:00,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:00,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:00,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:00,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:00,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:00,992 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:00,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:52:00,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:01,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:01,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:01,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:01,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,017 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:52:01,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:01,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:01,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:01,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,045 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:52:01,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-11-17 08:52:01,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:01,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:01,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:01,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-17 08:52:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,069 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:52:01,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:01,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:01,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:01,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:52:01,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,096 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:52:01,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:01,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:01,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:01,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:01,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,127 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-17 08:52:01,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-11-17 08:52:01,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:01,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:01,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:01,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-17 08:52:01,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,155 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-17 08:52:01,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-17 08:52:01,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,181 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-17 08:52:01,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:01,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,211 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:52:01,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-17 08:52:01,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,241 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:52:01,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-17 08:52:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,271 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:52:01,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-11-17 08:52:01,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-17 08:52:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,302 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:52:01,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:52:01,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,335 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-17 08:52:01,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,362 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-17 08:52:01,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-17 08:52:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,391 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-17 08:52:01,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:01,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,421 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-17 08:52:01,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:01,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:01,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:01,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:01,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:01,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:01,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:01,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:52:01,459 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:52:01,459 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-17 08:52:01,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:01,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:01,461 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:01,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-17 08:52:01,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:52:01,473 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:52:01,474 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:52:01,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 + 11 Supporting invariants [] [2024-11-17 08:52:01,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-17 08:52:01,527 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-17 08:52:01,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-17 08:52:01,528 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-17 08:52:01,529 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-17 08:52:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:01,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:52:01,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:01,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 08:52:01,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:01,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-17 08:52:01,940 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2024-11-17 08:52:01,941 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:02,198 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 287 transitions. Complement of second has 26 states. [2024-11-17 08:52:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-17 08:52:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-11-17 08:52:02,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2024-11-17 08:52:02,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:02,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2024-11-17 08:52:02,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:02,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2024-11-17 08:52:02,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:02,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2024-11-17 08:52:02,207 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-17 08:52:02,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2024-11-17 08:52:02,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-17 08:52:02,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-17 08:52:02,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2024-11-17 08:52:02,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:02,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-11-17 08:52:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2024-11-17 08:52:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2024-11-17 08:52:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.125) internal successors, (90), 88 states have internal predecessors, (90), 26 states have call successors, (26), 16 states have call predecessors, (26), 36 states have return successors, (50), 37 states have call predecessors, (50), 18 states have call successors, (50) [2024-11-17 08:52:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-11-17 08:52:02,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-17 08:52:02,217 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-17 08:52:02,217 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:52:02,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2024-11-17 08:52:02,218 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-17 08:52:02,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:02,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:02,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:02,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:52:02,219 INFO L745 eck$LassoCheckResult]: Stem: 9108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9109#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 9102#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 9123#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 9125#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 9111#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9144#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 9110#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 9112#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9117#func_to_recursive_line_23_to_23_0ENTRY [2024-11-17 08:52:02,219 INFO L747 eck$LassoCheckResult]: Loop: 9117#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9128#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9129#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9117#func_to_recursive_line_23_to_23_0ENTRY [2024-11-17 08:52:02,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 235025028, now seen corresponding path program 1 times [2024-11-17 08:52:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448633861] [2024-11-17 08:52:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash 32741, now seen corresponding path program 1 times [2024-11-17 08:52:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896596625] [2024-11-17 08:52:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash 833919618, now seen corresponding path program 1 times [2024-11-17 08:52:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674899164] [2024-11-17 08:52:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:02,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:03,910 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:03,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:03,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:03,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:03,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:52:03,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:03,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:03,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:03,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2024-11-17 08:52:03,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:03,910 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:03,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:03,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:04,469 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:04,469 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:52:04,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,471 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-17 08:52:04,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,496 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-17 08:52:04,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-17 08:52:04,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,521 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-17 08:52:04,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,546 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-17 08:52:04,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,571 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-17 08:52:04,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-17 08:52:04,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,595 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-17 08:52:04,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-17 08:52:04,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,620 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-17 08:52:04,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-17 08:52:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,644 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-17 08:52:04,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,668 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-17 08:52:04,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-17 08:52:04,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,692 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-17 08:52:04,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-17 08:52:04,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,716 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-17 08:52:04,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-11-17 08:52:04,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-17 08:52:04,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,740 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-17 08:52:04,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-17 08:52:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,763 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-17 08:52:04,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-17 08:52:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,787 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-17 08:52:04,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:04,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:04,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:04,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-17 08:52:04,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,811 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-17 08:52:04,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:04,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:04,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:04,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,836 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-17 08:52:04,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:04,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:04,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:04,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:04,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:04,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:04,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:04,858 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:52:04,873 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:52:04,874 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-17 08:52:04,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:04,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:04,875 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:04,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-17 08:52:04,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:52:04,887 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:52:04,887 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:52:04,887 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_1 + 11 Supporting invariants [] [2024-11-17 08:52:04,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:04,910 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-17 08:52:04,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 08:52:04,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 08:52:04,911 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-17 08:52:04,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:04,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:52:04,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:04,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:52:04,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:04,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:05,005 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:52:05,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:05,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 223 transitions. Complement of second has 15 states. [2024-11-17 08:52:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-17 08:52:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:52:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-11-17 08:52:05,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-17 08:52:05,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:05,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-17 08:52:05,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:05,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-17 08:52:05,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:05,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2024-11-17 08:52:05,066 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-17 08:52:05,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2024-11-17 08:52:05,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-17 08:52:05,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-17 08:52:05,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2024-11-17 08:52:05,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:05,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-17 08:52:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2024-11-17 08:52:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-17 08:52:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.118279569892473) internal successors, (104), 104 states have internal predecessors, (104), 31 states have call successors, (31), 20 states have call predecessors, (31), 38 states have return successors, (65), 37 states have call predecessors, (65), 23 states have call successors, (65) [2024-11-17 08:52:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-17 08:52:05,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-17 08:52:05,080 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-17 08:52:05,080 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:52:05,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2024-11-17 08:52:05,081 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-17 08:52:05,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:05,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:05,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:05,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:52:05,082 INFO L745 eck$LassoCheckResult]: Stem: 9529#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9530#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 9523#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 9543#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 9545#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 9572#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 9573#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 9610#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9612#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9638#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9616#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9636#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9630#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9617#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9636#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9630#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9617#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9636#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9630#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9617#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9636#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9630#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9617#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9636#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9630#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9617#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9636#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9631#func_to_recursive_line_23_to_23_0FINAL assume true; 9632#func_to_recursive_line_23_to_23_0EXIT >#37#return; 9628#func_to_recursive_line_23_to_23_0FINAL assume true; 9627#func_to_recursive_line_23_to_23_0EXIT >#37#return; 9626#func_to_recursive_line_23_to_23_0FINAL assume true; 9625#func_to_recursive_line_23_to_23_0EXIT >#37#return; 9624#func_to_recursive_line_23_to_23_0FINAL assume true; 9623#func_to_recursive_line_23_to_23_0EXIT >#37#return; 9622#func_to_recursive_line_23_to_23_0FINAL assume true; 9621#func_to_recursive_line_23_to_23_0EXIT >#37#return; 9619#func_to_recursive_line_23_to_23_0FINAL assume true; 9614#func_to_recursive_line_23_to_23_0EXIT >#37#return; 9613#func_to_recursive_line_23_to_23_0FINAL assume true; 9609#func_to_recursive_line_23_to_23_0EXIT >#41#return; 9608#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9532#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9587#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 9531#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 9533#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9537#func_to_recursive_line_23_to_23_0ENTRY [2024-11-17 08:52:05,082 INFO L747 eck$LassoCheckResult]: Loop: 9537#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9549#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9548#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9537#func_to_recursive_line_23_to_23_0ENTRY [2024-11-17 08:52:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2105313028, now seen corresponding path program 2 times [2024-11-17 08:52:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:05,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847224212] [2024-11-17 08:52:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:05,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:05,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 32741, now seen corresponding path program 2 times [2024-11-17 08:52:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187303559] [2024-11-17 08:52:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:05,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:05,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 27009290, now seen corresponding path program 3 times [2024-11-17 08:52:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987976818] [2024-11-17 08:52:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:05,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-17 08:52:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:05,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-17 08:52:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:05,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:05,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:08,119 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:08,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:08,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:08,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:08,119 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:52:08,119 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,119 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:08,119 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:08,119 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2024-11-17 08:52:08,119 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:08,119 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:08,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:08,642 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:08,642 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:52:08,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,644 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-17 08:52:08,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,668 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-17 08:52:08,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,694 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-17 08:52:08,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,718 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-17 08:52:08,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,742 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-17 08:52:08,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-17 08:52:08,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,766 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-17 08:52:08,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-17 08:52:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,790 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-17 08:52:08,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-11-17 08:52:08,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,815 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-17 08:52:08,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-17 08:52:08,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,839 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-17 08:52:08,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,851 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,863 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-17 08:52:08,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,887 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-17 08:52:08,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,911 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-17 08:52:08,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-17 08:52:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,935 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-17 08:52:08,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,960 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-17 08:52:08,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:08,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:08,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:08,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:08,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:08,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:08,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:08,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:08,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:08,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:08,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:08,987 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:08,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-17 08:52:08,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:09,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:09,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:09,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:09,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:09,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,020 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-17 08:52:09,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:09,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:09,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:09,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:09,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:09,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,050 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-17 08:52:09,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:09,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:09,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:09,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:09,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:09,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-17 08:52:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,075 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-17 08:52:09,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:09,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:09,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:09,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:09,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:09,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:09,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,099 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-17 08:52:09,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-11-17 08:52:09,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:09,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:09,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:09,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:09,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-17 08:52:09,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,123 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-17 08:52:09,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:09,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:09,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:09,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:09,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:09,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-17 08:52:09,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,149 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-17 08:52:09,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:09,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:09,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:09,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:09,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:09,163 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:09,163 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:09,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:52:09,179 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:52:09,179 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-17 08:52:09,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:09,181 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:09,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-17 08:52:09,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:52:09,192 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:52:09,192 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:52:09,192 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2 + 11 Supporting invariants [] [2024-11-17 08:52:09,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-17 08:52:09,213 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-17 08:52:09,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 08:52:09,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 08:52:09,215 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-17 08:52:09,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:09,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 08:52:09,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:09,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:52:09,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:09,625 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-11-17 08:52:09,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:09,699 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2024-11-17 08:52:09,703 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-11-17 08:52:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-17 08:52:09,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-17 08:52:09,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:09,704 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:52:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:09,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 08:52:09,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:10,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:52:10,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:10,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:10,133 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-11-17 08:52:10,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:10,202 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2024-11-17 08:52:10,203 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-11-17 08:52:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-17 08:52:10,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-17 08:52:10,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:10,203 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:52:10,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:10,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 08:52:10,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:10,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-17 08:52:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:10,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:52:10,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:10,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 36 treesize of output 20 [2024-11-17 08:52:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:52:10,674 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-11-17 08:52:10,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:10,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 223 states and 275 transitions. Complement of second has 17 states. [2024-11-17 08:52:10,792 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-11-17 08:52:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 08:52:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2024-11-17 08:52:10,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-17 08:52:10,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:10,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 51 letters. Loop has 3 letters. [2024-11-17 08:52:10,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:10,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 6 letters. [2024-11-17 08:52:10,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:10,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 275 transitions. [2024-11-17 08:52:10,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:52:10,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 129 states and 159 transitions. [2024-11-17 08:52:10,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-17 08:52:10,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-17 08:52:10,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 159 transitions. [2024-11-17 08:52:10,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:52:10,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 159 transitions. [2024-11-17 08:52:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 159 transitions. [2024-11-17 08:52:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-17 08:52:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.088235294117647) internal successors, (74), 74 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 29 states have return successors, (46), 30 states have call predecessors, (46), 17 states have call successors, (46) [2024-11-17 08:52:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-11-17 08:52:10,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-17 08:52:10,802 INFO L425 stractBuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-17 08:52:10,803 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:52:10,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2024-11-17 08:52:10,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:52:10,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:52:10,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:52:10,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:10,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:52:10,810 INFO L745 eck$LassoCheckResult]: Stem: 10837#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10838#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 10831#L86-1 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 10852#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 10853#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 10873#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10876#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10906#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10905#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10849#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10947#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10858#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10877#func_to_recursive_line_23_to_23_0FINAL assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10867#func_to_recursive_line_23_to_23_0FINAL assume true; 10946#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10945#func_to_recursive_line_23_to_23_0FINAL assume true; 10944#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10943#func_to_recursive_line_23_to_23_0FINAL assume true; 10941#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10940#func_to_recursive_line_23_to_23_0FINAL assume true; 10937#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10927#func_to_recursive_line_23_to_23_0FINAL assume true; 10926#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10924#func_to_recursive_line_23_to_23_0FINAL assume true; 10904#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10872#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10844#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10909#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10907#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10848#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10849#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10947#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10858#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10877#func_to_recursive_line_23_to_23_0FINAL assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10867#func_to_recursive_line_23_to_23_0FINAL assume true; 10946#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10945#func_to_recursive_line_23_to_23_0FINAL assume true; 10944#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10943#func_to_recursive_line_23_to_23_0FINAL assume true; 10941#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10940#func_to_recursive_line_23_to_23_0FINAL assume true; 10937#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10927#func_to_recursive_line_23_to_23_0FINAL assume true; 10926#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10924#func_to_recursive_line_23_to_23_0FINAL assume true; 10904#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10903#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10845#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10909#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10907#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10848#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10849#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10947#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10858#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10877#func_to_recursive_line_23_to_23_0FINAL assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10867#func_to_recursive_line_23_to_23_0FINAL assume true; 10946#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10945#func_to_recursive_line_23_to_23_0FINAL assume true; 10944#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10943#func_to_recursive_line_23_to_23_0FINAL assume true; 10941#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10940#func_to_recursive_line_23_to_23_0FINAL assume true; 10937#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10927#func_to_recursive_line_23_to_23_0FINAL assume true; 10926#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10924#func_to_recursive_line_23_to_23_0FINAL assume true; 10904#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10903#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10845#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10909#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10907#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10848#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10849#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10947#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10858#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10877#func_to_recursive_line_23_to_23_0FINAL assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10867#func_to_recursive_line_23_to_23_0FINAL assume true; 10946#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10945#func_to_recursive_line_23_to_23_0FINAL assume true; 10944#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10943#func_to_recursive_line_23_to_23_0FINAL assume true; 10941#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10940#func_to_recursive_line_23_to_23_0FINAL assume true; 10937#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10927#func_to_recursive_line_23_to_23_0FINAL assume true; 10926#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10924#func_to_recursive_line_23_to_23_0FINAL assume true; 10904#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10903#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10845#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10909#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10907#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10848#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10849#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10947#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10858#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10877#func_to_recursive_line_23_to_23_0FINAL assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10867#func_to_recursive_line_23_to_23_0FINAL assume true; 10946#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10945#func_to_recursive_line_23_to_23_0FINAL assume true; 10944#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10943#func_to_recursive_line_23_to_23_0FINAL assume true; 10941#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10940#func_to_recursive_line_23_to_23_0FINAL assume true; 10937#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10927#func_to_recursive_line_23_to_23_0FINAL assume true; 10926#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10924#func_to_recursive_line_23_to_23_0FINAL assume true; 10904#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10903#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10845#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10909#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10907#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10848#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10849#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10947#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10858#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10860#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10859#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10857#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10861#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10877#func_to_recursive_line_23_to_23_0FINAL assume true; 10866#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10867#func_to_recursive_line_23_to_23_0FINAL assume true; 10946#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10945#func_to_recursive_line_23_to_23_0FINAL assume true; 10944#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10943#func_to_recursive_line_23_to_23_0FINAL assume true; 10941#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10940#func_to_recursive_line_23_to_23_0FINAL assume true; 10937#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10927#func_to_recursive_line_23_to_23_0FINAL assume true; 10926#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10924#func_to_recursive_line_23_to_23_0FINAL assume true; 10904#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10903#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10845#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10909#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10843#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10846#func_to_recursive_line_22_to_23_0FINAL assume true; 10910#func_to_recursive_line_22_to_23_0EXIT >#39#return; 10870#func_to_recursive_line_22_to_23_0FINAL assume true; 10902#func_to_recursive_line_22_to_23_0EXIT >#39#return; 10901#func_to_recursive_line_22_to_23_0FINAL assume true; 10900#func_to_recursive_line_22_to_23_0EXIT >#39#return; 10899#func_to_recursive_line_22_to_23_0FINAL assume true; 10898#func_to_recursive_line_22_to_23_0EXIT >#39#return; 10897#func_to_recursive_line_22_to_23_0FINAL assume true; 10896#func_to_recursive_line_22_to_23_0EXIT >#39#return; 10895#func_to_recursive_line_22_to_23_0FINAL assume true; 10894#func_to_recursive_line_22_to_23_0EXIT >#39#return; 10893#func_to_recursive_line_22_to_23_0FINAL assume true; 10891#func_to_recursive_line_22_to_23_0EXIT >#47#return; 10875#L67 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 10830#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 10832#func_to_recursive_line_21_to_22_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#2(~a.base, ~a.offset, 4); 10855#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 10840#L67-1 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10850#func_to_recursive_line_22_to_23_0ENTRY [2024-11-17 08:52:10,811 INFO L747 eck$LassoCheckResult]: Loop: 10850#func_to_recursive_line_22_to_23_0ENTRY ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~b.base, ~b.offset, 4); 10839#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10842#L47-1 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10847#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10856#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10863#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10878#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10879#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10864#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10878#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10879#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10864#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10878#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10879#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10864#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10878#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10879#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10864#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10878#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10879#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10864#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10878#func_to_recursive_line_23_to_23_0ENTRY ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10868#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10869#func_to_recursive_line_23_to_23_0FINAL assume true; 10862#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10865#func_to_recursive_line_23_to_23_0FINAL assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10889#func_to_recursive_line_23_to_23_0FINAL assume true; 10888#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10887#func_to_recursive_line_23_to_23_0FINAL assume true; 10886#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10885#func_to_recursive_line_23_to_23_0FINAL assume true; 10884#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10883#func_to_recursive_line_23_to_23_0FINAL assume true; 10882#func_to_recursive_line_23_to_23_0EXIT >#37#return; 10881#func_to_recursive_line_23_to_23_0FINAL assume true; 10880#func_to_recursive_line_23_to_23_0EXIT >#41#return; 10871#L47 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10841#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10850#func_to_recursive_line_22_to_23_0ENTRY [2024-11-17 08:52:10,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1550122481, now seen corresponding path program 2 times [2024-11-17 08:52:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544459870] [2024-11-17 08:52:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:10,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:10,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1356371725, now seen corresponding path program 2 times [2024-11-17 08:52:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894542839] [2024-11-17 08:52:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:10,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:10,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash 761371907, now seen corresponding path program 3 times [2024-11-17 08:52:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:52:10,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484221704] [2024-11-17 08:52:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:52:10,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:52:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:11,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:52:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:52:11,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:52:22,197 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:52:22,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:52:22,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:52:22,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:52:22,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:52:22,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:22,197 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:52:22,197 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:52:22,197 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration13_Lasso [2024-11-17 08:52:22,197 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:52:22,197 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:52:22,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:52:22,966 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:52:22,966 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:52:22,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:22,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:22,968 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:22,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-17 08:52:22,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:22,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:22,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:22,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:22,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:22,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:22,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:22,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:22,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:22,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-17 08:52:22,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:22,994 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:22,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-17 08:52:22,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-17 08:52:23,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,020 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-17 08:52:23,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,034 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-17 08:52:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,046 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-17 08:52:23,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-17 08:52:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,073 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-17 08:52:23,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2024-11-17 08:52:23,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,097 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-17 08:52:23,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-17 08:52:23,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,121 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-17 08:52:23,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-17 08:52:23,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,144 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-17 08:52:23,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,157 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-17 08:52:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,169 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-17 08:52:23,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-17 08:52:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,192 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-17 08:52:23,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-11-17 08:52:23,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-17 08:52:23,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,216 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-17 08:52:23,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2024-11-17 08:52:23,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,239 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-17 08:52:23,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:52:23,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:52:23,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:52:23,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,264 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-17 08:52:23,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-11-17 08:52:23,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-17 08:52:23,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,289 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-17 08:52:23,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-11-17 08:52:23,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,315 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-17 08:52:23,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,327 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,341 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-17 08:52:23,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,367 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-17 08:52:23,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-17 08:52:23,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,393 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-17 08:52:23,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,418 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-17 08:52:23,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,445 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-17 08:52:23,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:23,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,471 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-17 08:52:23,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-17 08:52:23,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,499 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-11-17 08:52:23,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:52:23,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-11-17 08:52:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,525 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-17 08:52:23,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:52:23,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:52:23,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:52:23,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:52:23,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:52:23,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:52:23,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:52:23,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:52:23,560 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-17 08:52:23,560 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:52:23,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:52:23,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:52:23,561 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:52:23,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-17 08:52:23,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:52:23,572 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:52:23,572 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:52:23,572 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_2) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_2 + 11 Supporting invariants [] [2024-11-17 08:52:23,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-17 08:52:23,606 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-17 08:52:23,607 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-17 08:52:23,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-17 08:52:23,608 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-17 08:52:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:23,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-17 08:52:23,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:24,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-17 08:52:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:25,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 08:52:25,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:25,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-17 08:52:25,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2024-11-17 08:52:25,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:52:26,019 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 26 states. [2024-11-17 08:52:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-17 08:52:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:52:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-11-17 08:52:26,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-17 08:52:26,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:26,023 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:52:26,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:26,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-17 08:52:26,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:28,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-17 08:52:28,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:28,426 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 17 treesize of output 9 [2024-11-17 08:52:28,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-17 08:52:28,616 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 6 loop predicates [2024-11-17 08:52:28,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 08:52:28,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Result 150 states and 176 transitions. Complement of second has 30 states. [2024-11-17 08:52:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 6 non-accepting loop states 1 accepting loop states [2024-11-17 08:52:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 08:52:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2024-11-17 08:52:28,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-17 08:52:28,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:28,856 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:52:28,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:52:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:29,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-17 08:52:29,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:52:30,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-17 08:52:30,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:52:31,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-17 08:52:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-17 08:52:31,037 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 5 loop predicates [2024-11-17 08:52:31,037 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:52:31,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 225 states and 258 transitions. Complement of second has 30 states. [2024-11-17 08:52:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-17 08:52:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:52:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2024-11-17 08:52:31,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-17 08:52:31,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:31,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 300 letters. Loop has 39 letters. [2024-11-17 08:52:31,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:31,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 261 letters. Loop has 78 letters. [2024-11-17 08:52:31,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:52:31,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 258 transitions. [2024-11-17 08:52:31,323 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:52:31,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2024-11-17 08:52:31,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:52:31,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:52:31,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:52:31,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:52:31,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:52:31,323 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:52:31,323 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:52:31,323 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:52:31,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:52:31,323 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:52:31,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:52:31,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:52:31 BoogieIcfgContainer [2024-11-17 08:52:31,329 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:52:31,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:52:31,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:52:31,330 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:52:31,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:51:19" (3/4) ... [2024-11-17 08:52:31,332 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:52:31,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:52:31,333 INFO L158 Benchmark]: Toolchain (without parser) took 72881.56ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 123.1MB in the beginning and 598.2MB in the end (delta: -475.0MB). Peak memory consumption was 578.8MB. Max. memory is 16.1GB. [2024-11-17 08:52:31,333 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:52:31,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.38ms. Allocated memory is still 165.7MB. Free memory was 123.1MB in the beginning and 111.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:52:31,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.67ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:52:31,333 INFO L158 Benchmark]: Boogie Preprocessor took 42.88ms. Allocated memory is still 165.7MB. Free memory was 109.0MB in the beginning and 106.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:52:31,334 INFO L158 Benchmark]: IcfgBuilder took 367.49ms. Allocated memory is still 165.7MB. Free memory was 106.9MB in the beginning and 127.1MB in the end (delta: -20.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 08:52:31,334 INFO L158 Benchmark]: BuchiAutomizer took 72236.59ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 127.1MB in the beginning and 598.2MB in the end (delta: -471.1MB). Peak memory consumption was 584.9MB. Max. memory is 16.1GB. [2024-11-17 08:52:31,334 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 1.2GB. Free memory is still 598.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:52:31,335 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.38ms. Allocated memory is still 165.7MB. Free memory was 123.1MB in the beginning and 111.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.67ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.88ms. Allocated memory is still 165.7MB. Free memory was 109.0MB in the beginning and 106.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 367.49ms. Allocated memory is still 165.7MB. Free memory was 106.9MB in the beginning and 127.1MB in the end (delta: -20.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 72236.59ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 127.1MB in the beginning and 598.2MB in the end (delta: -471.1MB). Peak memory consumption was 584.9MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 1.2GB. Free memory is still 598.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 11 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 12 locations. 8 modules have a trivial ranking function, the largest among these consists of 46 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 72.1s and 14 iterations. TraceHistogramMax:42. Analysis of lassos took 57.2s. Construction of modules took 1.5s. Büchi inclusion checks took 13.3s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4401/4401 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 585 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 572 mSDsluCounter, 1318 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2302 IncrementalHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 499 mSolverCounterUnsat, 268 mSDtfsCounter, 2302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital271 mio100 ax100 hnf100 lsp94 ukn66 mio100 lsp21 div100 bol100 ite100 ukn100 eq215 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:52:31,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:31,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 08:52:31,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:52:31,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 08:52:32,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 08:52:32,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 08:52:32,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE