./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -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 c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:20:14,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:20:14,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:20:14,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:20:14,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:20:14,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:20:14,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:20:14,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:20:14,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:20:14,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:20:14,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:20:14,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:20:14,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:20:14,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:20:14,806 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:20:14,806 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:20:14,806 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:20:14,806 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:20:14,806 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:20:14,807 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:20:14,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:20:14,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:20:14,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:20:14,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:20:14,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:20:14,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:20:14,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:20:14,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:20:14,809 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:20:14,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:20:14,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:20:14,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:20:14,810 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:20:14,810 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2025-03-17 20:20:15,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:20:15,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:20:15,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:20:15,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:20:15,085 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:20:15,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-17 20:20:16,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f30100e/ed3b381ec50341ef92eb3deca03828ee/FLAGadf1653be [2025-03-17 20:20:16,490 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:20:16,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-17 20:20:16,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f30100e/ed3b381ec50341ef92eb3deca03828ee/FLAGadf1653be [2025-03-17 20:20:16,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f30100e/ed3b381ec50341ef92eb3deca03828ee [2025-03-17 20:20:16,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:20:16,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:20:16,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:20:16,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:20:16,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:20:16,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9de218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:16, skipping insertion in model container [2025-03-17 20:20:16,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:20:16" (1/1) ... [2025-03-17 20:20:16,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:20:16,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:20:16,982 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:20:17,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:20:17,017 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:20:17,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17 WrapperNode [2025-03-17 20:20:17,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:20:17,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:20:17,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:20:17,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:20:17,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,039 INFO L138 Inliner]: procedures = 42, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2025-03-17 20:20:17,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:20:17,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:20:17,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:20:17,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:20:17,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,058 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 1, 10]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-17 20:20:17,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:20:17,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:20:17,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:20:17,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:20:17,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (1/1) ... [2025-03-17 20:20:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:17,108 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) [2025-03-17 20:20:17,110 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 [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 20:20:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 20:20:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 20:20:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:20:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 20:20:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 20:20:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:20:17,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:20:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 20:20:17,179 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:20:17,180 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:20:17,342 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset; [2025-03-17 20:20:17,343 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset);havoc parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset; [2025-03-17 20:20:17,343 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-17 20:20:17,361 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-17 20:20:17,361 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:20:17,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:20:17,369 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 20:20:17,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:20:17 BoogieIcfgContainer [2025-03-17 20:20:17,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:20:17,370 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:20:17,370 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:20:17,375 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:20:17,375 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:20:17,376 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:20:16" (1/3) ... [2025-03-17 20:20:17,377 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b39ef7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:20:17, skipping insertion in model container [2025-03-17 20:20:17,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:20:17,377 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:20:17" (2/3) ... [2025-03-17 20:20:17,378 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b39ef7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:20:17, skipping insertion in model container [2025-03-17 20:20:17,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:20:17,378 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:20:17" (3/3) ... [2025-03-17 20:20:17,379 INFO L363 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2025-03-17 20:20:17,413 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:20:17,414 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:20:17,414 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:20:17,414 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:20:17,414 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:20:17,414 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:20:17,414 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:20:17,414 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:20:17,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-17 20:20:17,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:17,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:17,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:20:17,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:20:17,435 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:20:17,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:17,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-17 20:20:17,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:17,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:17,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-03-17 20:20:17,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-17 20:20:17,440 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" [2025-03-17 20:20:17,440 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" [2025-03-17 20:20:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash 92, now seen corresponding path program 1 times [2025-03-17 20:20:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061017465] [2025-03-17 20:20:17,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:17,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:17,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:17,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:17,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 91, now seen corresponding path program 1 times [2025-03-17 20:20:17,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451446202] [2025-03-17 20:20:17,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:17,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:17,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:17,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:17,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2912, now seen corresponding path program 1 times [2025-03-17 20:20:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:17,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561091802] [2025-03-17 20:20:17,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:17,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:17,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:17,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:17,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:17,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:20:17,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:20:17,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:17,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:17,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:17,864 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:17,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:17,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:17,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:17,865 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:17,865 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:17,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:17,865 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:17,865 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2025-03-17 20:20:17,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:17,865 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:17,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:17,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:18,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:18,201 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:18,206 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 20:20:18,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-17 20:20:18,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 20:20:18,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 20:20:18,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 20:20:18,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 20:20:18,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 20:20:18,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-17 20:20:18,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 20:20:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 20:20:18,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 [2025-03-17 20:20:18,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,393 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) [2025-03-17 20:20:18,395 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 [2025-03-17 20:20:18,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:18,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:18,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:18,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,413 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 [2025-03-17 20:20:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,415 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) [2025-03-17 20:20:18,416 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 [2025-03-17 20:20:18,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:20:18,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,445 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) [2025-03-17 20:20:18,447 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 [2025-03-17 20:20:18,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,480 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) [2025-03-17 20:20:18,481 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 [2025-03-17 20:20:18,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,505 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 [2025-03-17 20:20:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,518 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) [2025-03-17 20:20:18,521 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 [2025-03-17 20:20:18,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,552 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 [2025-03-17 20:20:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,555 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) [2025-03-17 20:20:18,558 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 [2025-03-17 20:20:18,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:18,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:18,584 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 [2025-03-17 20:20:18,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,586 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) [2025-03-17 20:20:18,587 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 [2025-03-17 20:20:18,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 [2025-03-17 20:20:18,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:18,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:18,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:18,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:18,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:18,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:18,610 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:18,638 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-03-17 20:20:18,640 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 20:20:18,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:18,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:18,643 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) [2025-03-17 20:20:18,645 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 [2025-03-17 20:20:18,646 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:18,657 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:18,658 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:18,658 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 13*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-03-17 20:20:18,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:18,677 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-17 20:20:18,684 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:18,685 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:18,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:18,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:18,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:18,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:18,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-17 20:20:18,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-17 20:20:18,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:18,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:18,755 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:20:18,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 51 transitions. Complement of second has 3 states. [2025-03-17 20:20:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-03-17 20:20:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-03-17 20:20:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-17 20:20:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:18,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-03-17 20:20:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:18,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 51 transitions. [2025-03-17 20:20:18,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 20:20:18,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 28 states and 43 transitions. [2025-03-17 20:20:18,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:18,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:18,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 43 transitions. [2025-03-17 20:20:18,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:18,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-03-17 20:20:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 43 transitions. [2025-03-17 20:20:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-17 20:20:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2025-03-17 20:20:18,824 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-03-17 20:20:18,824 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 43 transitions. [2025-03-17 20:20:18,824 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:20:18,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 43 transitions. [2025-03-17 20:20:18,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-03-17 20:20:18,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:18,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:18,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:20:18,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:18,825 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:18,825 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash 90299, now seen corresponding path program 1 times [2025-03-17 20:20:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216452950] [2025-03-17 20:20:18,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:18,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:18,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216452950] [2025-03-17 20:20:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216452950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:20:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694163190] [2025-03-17 20:20:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:18,904 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:18,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2583454, now seen corresponding path program 1 times [2025-03-17 20:20:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69378391] [2025-03-17 20:20:18,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:18,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:18,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:18,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:18,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:18,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:18,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:18,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:20:18,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:20:18,978 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:18,989 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2025-03-17 20:20:18,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2025-03-17 20:20:18,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 20:20:18,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 36 transitions. [2025-03-17 20:20:18,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:20:18,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:20:18,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2025-03-17 20:20:18,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:18,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-17 20:20:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2025-03-17 20:20:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 20:20:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-17 20:20:18,994 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-17 20:20:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:20:18,997 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-17 20:20:18,997 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:20:18,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. [2025-03-17 20:20:18,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 20:20:18,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:18,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:18,999 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 20:20:18,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:18,999 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:18,999 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:18,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2800319, now seen corresponding path program 1 times [2025-03-17 20:20:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:18,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-03-17 20:20:18,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-03-17 20:20:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116296174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389642425] [2025-03-17 20:20:19,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:19,063 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:19,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 20:20:19,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 20:20:19,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:19,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:19,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389642425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:19,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:19,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 20:20:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087483135] [2025-03-17 20:20:19,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:19,135 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2583454, now seen corresponding path program 2 times [2025-03-17 20:20:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-03-17 20:20:19,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:19,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:19,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:19,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:19,219 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:19,235 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2025-03-17 20:20:19,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2025-03-17 20:20:19,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 20:20:19,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 39 transitions. [2025-03-17 20:20:19,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:20:19,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:20:19,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2025-03-17 20:20:19,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:19,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-17 20:20:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2025-03-17 20:20:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-17 20:20:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-17 20:20:19,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-17 20:20:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 20:20:19,243 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-17 20:20:19,243 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:20:19,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2025-03-17 20:20:19,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 20:20:19,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:19,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:19,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-03-17 20:20:19,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:19,244 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:19,244 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:19,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1820967355, now seen corresponding path program 2 times [2025-03-17 20:20:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248268471] [2025-03-17 20:20:19,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 20:20:19,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:20:19,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:19,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248268471] [2025-03-17 20:20:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248268471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411794849] [2025-03-17 20:20:19,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:19,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:19,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 20:20:19,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:19,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-03-17 20:20:19,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:20:19,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:19,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:19,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:19,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:19,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411794849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:19,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-17 20:20:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466397278] [2025-03-17 20:20:19,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:19,493 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:19,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2583454, now seen corresponding path program 3 times [2025-03-17 20:20:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832191580] [2025-03-17 20:20:19,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:19,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:19,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 20:20:19,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 20:20:19,558 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. cyclomatic complexity: 12 Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:19,575 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-17 20:20:19,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2025-03-17 20:20:19,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 20:20:19,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 42 transitions. [2025-03-17 20:20:19,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-17 20:20:19,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-17 20:20:19,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2025-03-17 20:20:19,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:19,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-17 20:20:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2025-03-17 20:20:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 20:20:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-17 20:20:19,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-17 20:20:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 20:20:19,583 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-17 20:20:19,584 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:20:19,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2025-03-17 20:20:19,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2025-03-17 20:20:19,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:19,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:19,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1] [2025-03-17 20:20:19,584 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 20:20:19,584 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" [2025-03-17 20:20:19,586 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" [2025-03-17 20:20:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1292400321, now seen corresponding path program 3 times [2025-03-17 20:20:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158786342] [2025-03-17 20:20:19,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:19,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 5 equivalence classes. [2025-03-17 20:20:19,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:20:19,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 20:20:19,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:20:19,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:20:19,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2583454, now seen corresponding path program 4 times [2025-03-17 20:20:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751368296] [2025-03-17 20:20:19,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,643 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-03-17 20:20:19,644 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:19,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:19,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:19,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash -308533796, now seen corresponding path program 1 times [2025-03-17 20:20:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:19,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615940194] [2025-03-17 20:20:19,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:19,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:20:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:20:19,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:19,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 20:20:19,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 20:20:19,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:19,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:19,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:23,221 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:23,221 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:23,221 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:23,221 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:23,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:23,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:23,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:23,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration5_Lasso [2025-03-17 20:20:23,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:23,222 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:23,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:23,752 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:23,752 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:23,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,754 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) [2025-03-17 20:20:23,756 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 [2025-03-17 20:20:23,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,775 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 [2025-03-17 20:20:23,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,777 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) [2025-03-17 20:20:23,778 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 [2025-03-17 20:20:23,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,794 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 [2025-03-17 20:20:23,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,796 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) [2025-03-17 20:20:23,797 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 [2025-03-17 20:20:23,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:20:23,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,816 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) [2025-03-17 20:20:23,817 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 [2025-03-17 20:20:23,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,835 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 [2025-03-17 20:20:23,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,837 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) [2025-03-17 20:20:23,838 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 [2025-03-17 20:20:23,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:23,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,857 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) [2025-03-17 20:20:23,860 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 [2025-03-17 20:20:23,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,879 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 [2025-03-17 20:20:23,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,880 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) [2025-03-17 20:20:23,882 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 [2025-03-17 20:20:23,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,906 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 [2025-03-17 20:20:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,908 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) [2025-03-17 20:20:23,909 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 [2025-03-17 20:20:23,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:23,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:23,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-17 20:20:23,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,930 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) [2025-03-17 20:20:23,930 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 [2025-03-17 20:20:23,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 20:20:23,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,950 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) [2025-03-17 20:20:23,950 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 [2025-03-17 20:20:23,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-17 20:20:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,971 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) [2025-03-17 20:20:23,972 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 [2025-03-17 20:20:23,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:23,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:23,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:23,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:23,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:23,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:23,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:23,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:23,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:23,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:23,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:23,996 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) [2025-03-17 20:20:23,997 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 [2025-03-17 20:20:23,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:24,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:24,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:24,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:24,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:24,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:24,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:24,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:24,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:24,021 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) [2025-03-17 20:20:24,023 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 [2025-03-17 20:20:24,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:24,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:24,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:24,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:24,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:24,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:24,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:24,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:24,046 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 [2025-03-17 20:20:24,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:24,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:24,071 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) [2025-03-17 20:20:24,072 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 [2025-03-17 20:20:24,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:24,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:24,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:24,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:24,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:24,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:24,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:24,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:24,091 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 [2025-03-17 20:20:24,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:24,093 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) [2025-03-17 20:20:24,094 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 [2025-03-17 20:20:24,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:24,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:24,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:24,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:24,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:24,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:24,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:24,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:24,125 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:20:24,125 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-03-17 20:20:24,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:24,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:24,128 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) [2025-03-17 20:20:24,129 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 [2025-03-17 20:20:24,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:24,140 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:24,140 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:24,140 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str#1.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1, ULTIMATE.start_parse_expression_list_~i~0#1) = -1*ULTIMATE.start_parse_expression_list_~str#1.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_1 - 1*ULTIMATE.start_parse_expression_list_~i~0#1 Supporting invariants [] [2025-03-17 20:20:24,146 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 [2025-03-17 20:20:24,172 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:24,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:24,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:24,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~str!offset [2025-03-17 20:20:24,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 20:20:24,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 20:20:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:24,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:24,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:24,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 20:20:24,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 20:20:24,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:24,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:20:24,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:24,258 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:20:24,259 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:24,288 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 75 transitions. Complement of second has 4 states. [2025-03-17 20:20:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-03-17 20:20:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-17 20:20:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:24,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 14 letters. Loop has 4 letters. [2025-03-17 20:20:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:24,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 10 letters. Loop has 8 letters. [2025-03-17 20:20:24,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:24,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2025-03-17 20:20:24,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:24,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 61 transitions. [2025-03-17 20:20:24,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-17 20:20:24,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-17 20:20:24,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 61 transitions. [2025-03-17 20:20:24,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:24,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 61 transitions. [2025-03-17 20:20:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 61 transitions. [2025-03-17 20:20:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-17 20:20:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-03-17 20:20:24,297 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-03-17 20:20:24,297 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-03-17 20:20:24,297 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:20:24,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. [2025-03-17 20:20:24,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:24,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:24,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:24,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1] [2025-03-17 20:20:24,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:24,298 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:24,298 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:24,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -751158211, now seen corresponding path program 1 times [2025-03-17 20:20:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959947050] [2025-03-17 20:20:24,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:24,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:20:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:20:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:24,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 20:20:24,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 20:20:24,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 79376, now seen corresponding path program 1 times [2025-03-17 20:20:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247731393] [2025-03-17 20:20:24,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:24,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:24,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:24,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:24,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:24,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,362 INFO L85 PathProgramCache]: Analyzing trace with hash -974602156, now seen corresponding path program 1 times [2025-03-17 20:20:24,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:24,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307453629] [2025-03-17 20:20:24,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:24,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 20:20:24,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 20:20:24,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:24,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-17 20:20:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307453629] [2025-03-17 20:20:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307453629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:24,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:24,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:20:24,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265974716] [2025-03-17 20:20:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:24,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:24,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:24,668 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. cyclomatic complexity: 20 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:24,747 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2025-03-17 20:20:24,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 101 transitions. [2025-03-17 20:20:24,747 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 20:20:24,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 101 transitions. [2025-03-17 20:20:24,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:24,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:24,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 101 transitions. [2025-03-17 20:20:24,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:24,751 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 101 transitions. [2025-03-17 20:20:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 101 transitions. [2025-03-17 20:20:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2025-03-17 20:20:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 50 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-03-17 20:20:24,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-03-17 20:20:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:24,757 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-03-17 20:20:24,758 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-17 20:20:24,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 69 transitions. [2025-03-17 20:20:24,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:24,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:24,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:24,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:24,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:24,759 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:24,759 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:24,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash -148232806, now seen corresponding path program 1 times [2025-03-17 20:20:24,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:24,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527207327] [2025-03-17 20:20:24,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:24,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:20:24,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:20:24,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:24,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:20:24,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:20:24,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:24,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash 79376, now seen corresponding path program 2 times [2025-03-17 20:20:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:24,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926171406] [2025-03-17 20:20:24,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:24,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:24,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:24,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:24,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:24,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:24,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:24,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:24,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:24,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash -777093673, now seen corresponding path program 1 times [2025-03-17 20:20:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065726819] [2025-03-17 20:20:24,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:24,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:20:24,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:20:24,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:24,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 20:20:24,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 20:20:24,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:24,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:24,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:28,025 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:28,025 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:28,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:28,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:28,026 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:28,026 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,026 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:28,026 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:28,026 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration7_Lasso [2025-03-17 20:20:28,026 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:28,026 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:28,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:28,617 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:28,617 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,622 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) [2025-03-17 20:20:28,623 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 [2025-03-17 20:20:28,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,641 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 [2025-03-17 20:20:28,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,643 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) [2025-03-17 20:20:28,645 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 [2025-03-17 20:20:28,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:28,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,668 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) [2025-03-17 20:20:28,668 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 [2025-03-17 20:20:28,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 [2025-03-17 20:20:28,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,686 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 [2025-03-17 20:20:28,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,688 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) [2025-03-17 20:20:28,689 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 [2025-03-17 20:20:28,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 [2025-03-17 20:20:28,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,706 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 [2025-03-17 20:20:28,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,708 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) [2025-03-17 20:20:28,708 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 [2025-03-17 20:20:28,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-17 20:20:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,732 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) [2025-03-17 20:20:28,734 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 [2025-03-17 20:20:28,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:28,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,756 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) [2025-03-17 20:20:28,756 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 [2025-03-17 20:20:28,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-03-17 20:20:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,776 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) [2025-03-17 20:20:28,776 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 [2025-03-17 20:20:28,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,795 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 [2025-03-17 20:20:28,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,797 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) [2025-03-17 20:20:28,798 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 [2025-03-17 20:20:28,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,815 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 [2025-03-17 20:20:28,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,817 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) [2025-03-17 20:20:28,818 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 [2025-03-17 20:20:28,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-03-17 20:20:28,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,837 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) [2025-03-17 20:20:28,839 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 [2025-03-17 20:20:28,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,856 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 [2025-03-17 20:20:28,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,859 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) [2025-03-17 20:20:28,859 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 [2025-03-17 20:20:28,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,877 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 [2025-03-17 20:20:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,879 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) [2025-03-17 20:20:28,880 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 [2025-03-17 20:20:28,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-17 20:20:28,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,899 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) [2025-03-17 20:20:28,900 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 [2025-03-17 20:20:28,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,918 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 [2025-03-17 20:20:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,920 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) [2025-03-17 20:20:28,922 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 [2025-03-17 20:20:28,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:28,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,947 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) [2025-03-17 20:20:28,947 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 [2025-03-17 20:20:28,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:28,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:28,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,966 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 [2025-03-17 20:20:28,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,968 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) [2025-03-17 20:20:28,969 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 [2025-03-17 20:20:28,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:28,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:28,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:28,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:28,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:28,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:28,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:28,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:28,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:28,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-03-17 20:20:28,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:28,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:28,989 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) [2025-03-17 20:20:28,989 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 [2025-03-17 20:20:28,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,011 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 [2025-03-17 20:20:29,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,013 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) [2025-03-17 20:20:29,014 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 [2025-03-17 20:20:29,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,035 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 [2025-03-17 20:20:29,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,037 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) [2025-03-17 20:20:29,044 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 [2025-03-17 20:20:29,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:29,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,069 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) [2025-03-17 20:20:29,070 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 [2025-03-17 20:20:29,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,081 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:20:29,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,083 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 20:20:29,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,095 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 [2025-03-17 20:20:29,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,097 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) [2025-03-17 20:20:29,097 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 [2025-03-17 20:20:29,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 [2025-03-17 20:20:29,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:29,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:29,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:29,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,115 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 [2025-03-17 20:20:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,117 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) [2025-03-17 20:20:29,118 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 [2025-03-17 20:20:29,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:29,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:29,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:29,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,135 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 [2025-03-17 20:20:29,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,137 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) [2025-03-17 20:20:29,138 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 [2025-03-17 20:20:29,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-17 20:20:29,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,162 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) [2025-03-17 20:20:29,164 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 [2025-03-17 20:20:29,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,184 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 [2025-03-17 20:20:29,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,187 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) [2025-03-17 20:20:29,187 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 [2025-03-17 20:20:29,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,208 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 [2025-03-17 20:20:29,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,211 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) [2025-03-17 20:20:29,211 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 [2025-03-17 20:20:29,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 [2025-03-17 20:20:29,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-17 20:20:29,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,234 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) [2025-03-17 20:20:29,235 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 [2025-03-17 20:20:29,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:29,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:29,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:29,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-17 20:20:29,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,255 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) [2025-03-17 20:20:29,256 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 [2025-03-17 20:20:29,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-03-17 20:20:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,278 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) [2025-03-17 20:20:29,279 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 [2025-03-17 20:20:29,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-17 20:20:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,301 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) [2025-03-17 20:20:29,301 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 [2025-03-17 20:20:29,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:29,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:29,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:29,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,319 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 [2025-03-17 20:20:29,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,321 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) [2025-03-17 20:20:29,323 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 [2025-03-17 20:20:29,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,342 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 [2025-03-17 20:20:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,344 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) [2025-03-17 20:20:29,345 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 [2025-03-17 20:20:29,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:29,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:29,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:29,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,363 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 [2025-03-17 20:20:29,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,365 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) [2025-03-17 20:20:29,366 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 [2025-03-17 20:20:29,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:29,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:29,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,393 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) [2025-03-17 20:20:29,393 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 [2025-03-17 20:20:29,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 [2025-03-17 20:20:29,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:29,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:29,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:29,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:29,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:29,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:29,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:29,425 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-17 20:20:29,425 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-17 20:20:29,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:29,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:29,427 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) [2025-03-17 20:20:29,427 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 [2025-03-17 20:20:29,428 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:29,439 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 20:20:29,439 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:29,439 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0#1, v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2) = -1*ULTIMATE.start_parse_expression_list_~start~0#1 + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str#1.base)_2 Supporting invariants [1*ULTIMATE.start_parse_expression_list_~str#1.offset >= 0] [2025-03-17 20:20:29,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-17 20:20:29,470 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2025-03-17 20:20:29,472 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 20:20:29,472 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 20:20:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 20:20:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 20:20:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 20:20:29,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:29,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:29,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:29,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:29,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:29,605 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-17 20:20:29,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 69 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 69 transitions. cyclomatic complexity: 22. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 153 states and 214 transitions. Complement of second has 9 states. [2025-03-17 20:20:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-17 20:20:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-03-17 20:20:29,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-17 20:20:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:29,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 19 letters. Loop has 3 letters. [2025-03-17 20:20:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:29,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-17 20:20:29,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:29,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 214 transitions. [2025-03-17 20:20:29,675 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2025-03-17 20:20:29,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 117 states and 162 transitions. [2025-03-17 20:20:29,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-03-17 20:20:29,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:20:29,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 162 transitions. [2025-03-17 20:20:29,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:29,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 162 transitions. [2025-03-17 20:20:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 162 transitions. [2025-03-17 20:20:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 76. [2025-03-17 20:20:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 75 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2025-03-17 20:20:29,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 107 transitions. [2025-03-17 20:20:29,679 INFO L432 stractBuchiCegarLoop]: Abstraction has 76 states and 107 transitions. [2025-03-17 20:20:29,679 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-17 20:20:29,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 107 transitions. [2025-03-17 20:20:29,679 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:29,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:29,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:29,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:29,681 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:29,681 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short14#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -393895562, now seen corresponding path program 1 times [2025-03-17 20:20:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022254423] [2025-03-17 20:20:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:29,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:29,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:29,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:29,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:29,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:29,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 67488, now seen corresponding path program 1 times [2025-03-17 20:20:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817258622] [2025-03-17 20:20:29,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:29,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817258622] [2025-03-17 20:20:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817258622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:20:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352274830] [2025-03-17 20:20:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:29,727 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 20:20:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:20:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:20:29,728 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:29,738 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2025-03-17 20:20:29,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 108 transitions. [2025-03-17 20:20:29,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 77 states and 107 transitions. [2025-03-17 20:20:29,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-17 20:20:29,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-17 20:20:29,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 107 transitions. [2025-03-17 20:20:29,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:29,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 107 transitions. [2025-03-17 20:20:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 107 transitions. [2025-03-17 20:20:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 20:20:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 76 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2025-03-17 20:20:29,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 107 transitions. [2025-03-17 20:20:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:20:29,745 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 107 transitions. [2025-03-17 20:20:29,745 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-17 20:20:29,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 107 transitions. [2025-03-17 20:20:29,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:29,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:29,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:29,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:29,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:29,746 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:29,747 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:29,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,747 INFO L85 PathProgramCache]: Analyzing trace with hash -393895593, now seen corresponding path program 1 times [2025-03-17 20:20:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174597123] [2025-03-17 20:20:29,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:29,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-17 20:20:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174597123] [2025-03-17 20:20:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174597123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:29,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:20:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128091995] [2025-03-17 20:20:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:29,960 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 64829154, now seen corresponding path program 1 times [2025-03-17 20:20:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151481528] [2025-03-17 20:20:29,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:29,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:29,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:29,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:29,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:29,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:29,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:29,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:30,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:30,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:30,037 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. cyclomatic complexity: 37 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,104 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2025-03-17 20:20:30,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 141 transitions. [2025-03-17 20:20:30,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 20:20:30,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 99 states and 133 transitions. [2025-03-17 20:20:30,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-03-17 20:20:30,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-03-17 20:20:30,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 133 transitions. [2025-03-17 20:20:30,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 133 transitions. [2025-03-17 20:20:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 133 transitions. [2025-03-17 20:20:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 73. [2025-03-17 20:20:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-03-17 20:20:30,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-17 20:20:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:30,111 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-17 20:20:30,111 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-17 20:20:30,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2025-03-17 20:20:30,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:30,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,112 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,112 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -393895562, now seen corresponding path program 2 times [2025-03-17 20:20:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-03-17 20:20:30,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-17 20:20:30,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:30,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:30,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 20:20:30,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 20:20:30,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 64829154, now seen corresponding path program 2 times [2025-03-17 20:20:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345923651] [2025-03-17 20:20:30,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,150 INFO L85 PathProgramCache]: Analyzing trace with hash 710620813, now seen corresponding path program 1 times [2025-03-17 20:20:30,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116431696] [2025-03-17 20:20:30,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 20:20:30,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 20:20:30,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116431696] [2025-03-17 20:20:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116431696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:30,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:30,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 20:20:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330886409] [2025-03-17 20:20:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:30,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 20:20:30,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 20:20:30,300 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. cyclomatic complexity: 35 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,346 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2025-03-17 20:20:30,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 128 transitions. [2025-03-17 20:20:30,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:30,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 91 states and 120 transitions. [2025-03-17 20:20:30,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:20:30,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-17 20:20:30,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 120 transitions. [2025-03-17 20:20:30,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-03-17 20:20:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 120 transitions. [2025-03-17 20:20:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-03-17 20:20:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 76 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2025-03-17 20:20:30,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 104 transitions. [2025-03-17 20:20:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 20:20:30,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2025-03-17 20:20:30,355 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-17 20:20:30,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2025-03-17 20:20:30,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-17 20:20:30,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,356 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume parse_expression_list_#t~short7#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,356 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash -522950539, now seen corresponding path program 1 times [2025-03-17 20:20:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131122648] [2025-03-17 20:20:30,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:20:30,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:20:30,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-17 20:20:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131122648] [2025-03-17 20:20:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131122648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:30,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 20:20:30,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92052423] [2025-03-17 20:20:30,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:30,381 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:30,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash 64829154, now seen corresponding path program 3 times [2025-03-17 20:20:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134270258] [2025-03-17 20:20:30,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:20:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:20:30,461 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. cyclomatic complexity: 34 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,468 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2025-03-17 20:20:30,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 108 transitions. [2025-03-17 20:20:30,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:20:30,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 81 states and 106 transitions. [2025-03-17 20:20:30,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-17 20:20:30,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-03-17 20:20:30,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 106 transitions. [2025-03-17 20:20:30,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-03-17 20:20:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 106 transitions. [2025-03-17 20:20:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 20:20:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2025-03-17 20:20:30,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-03-17 20:20:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:20:30,476 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-03-17 20:20:30,476 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-17 20:20:30,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 106 transitions. [2025-03-17 20:20:30,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-03-17 20:20:30,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,477 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,477 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash -523874060, now seen corresponding path program 1 times [2025-03-17 20:20:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29694888] [2025-03-17 20:20:30,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:20:30,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:20:30,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 20:20:30,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 20:20:30,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 64829154, now seen corresponding path program 4 times [2025-03-17 20:20:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754309175] [2025-03-17 20:20:30,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 20:20:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-03-17 20:20:30,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 20:20:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -785218097, now seen corresponding path program 1 times [2025-03-17 20:20:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583217391] [2025-03-17 20:20:30,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:30,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:30,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583217391] [2025-03-17 20:20:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583217391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 20:20:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675705710] [2025-03-17 20:20:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:30,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 20:20:30,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:30,585 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 20:20:30,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-03-17 20:20:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 20:20:30,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 20:20:30,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:30,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:30,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:30,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 20:20:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675705710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 20:20:30,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 20:20:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-17 20:20:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74738203] [2025-03-17 20:20:30,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 20:20:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:30,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 20:20:30,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 20:20:30,823 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. cyclomatic complexity: 32 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:30,896 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2025-03-17 20:20:30,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 195 transitions. [2025-03-17 20:20:30,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2025-03-17 20:20:30,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 134 states and 173 transitions. [2025-03-17 20:20:30,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-17 20:20:30,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-17 20:20:30,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 173 transitions. [2025-03-17 20:20:30,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:30,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 173 transitions. [2025-03-17 20:20:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 173 transitions. [2025-03-17 20:20:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 119. [2025-03-17 20:20:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 118 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2025-03-17 20:20:30,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 156 transitions. [2025-03-17 20:20:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 20:20:30,906 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 156 transitions. [2025-03-17 20:20:30,909 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-17 20:20:30,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 156 transitions. [2025-03-17 20:20:30,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:30,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:30,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:30,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:30,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 20:20:30,911 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume !parse_expression_list_#t~switch4#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume 34 == parse_expression_list_#t~mem9#1;havoc parse_expression_list_#t~mem9#1;parse_expression_list_#t~post10#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post10#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" [2025-03-17 20:20:30,911 INFO L754 eck$LassoCheckResult]: Loop: "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume parse_expression_list_#t~short14#1;call parse_expression_list_#t~mem11#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 32 == parse_expression_list_#t~mem11#1;" "assume !parse_expression_list_#t~short13#1;call parse_expression_list_#t~mem12#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short13#1 := 9 == parse_expression_list_#t~mem12#1;" "parse_expression_list_#t~short14#1 := parse_expression_list_#t~short13#1;" "assume parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;parse_expression_list_#t~post15#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post15#1 - 1;" [2025-03-17 20:20:30,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1673259537, now seen corresponding path program 2 times [2025-03-17 20:20:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075408752] [2025-03-17 20:20:30,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 20:20:30,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:20:30,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:20:30,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:20:30,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash 64829154, now seen corresponding path program 5 times [2025-03-17 20:20:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486512966] [2025-03-17 20:20:30,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 20:20:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:30,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:30,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 642848466, now seen corresponding path program 2 times [2025-03-17 20:20:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35036325] [2025-03-17 20:20:30,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 20:20:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:30,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 20:20:30,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:20:30,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 20:20:30,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 20:20:30,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 20:20:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:30,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:35,312 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:20:35,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:20:35,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:20:35,313 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:20:35,313 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:20:35,313 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:35,313 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:20:35,313 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:20:35,313 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration13_Lasso [2025-03-17 20:20:35,313 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:20:35,313 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:20:35,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:20:35,906 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:20:35,906 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:20:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:35,908 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) [2025-03-17 20:20:35,909 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 [2025-03-17 20:20:35,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:35,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:35,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:35,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:35,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:35,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:35,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:35,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:35,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:35,929 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 [2025-03-17 20:20:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:35,931 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) [2025-03-17 20:20:35,932 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 [2025-03-17 20:20:35,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:35,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:35,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:35,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:35,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:35,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:35,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:35,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:35,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:35,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-17 20:20:35,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:35,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:35,952 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) [2025-03-17 20:20:35,952 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 [2025-03-17 20:20:35,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:35,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:35,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:35,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:35,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:35,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:35,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:35,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:35,965 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:35,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-03-17 20:20:35,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:35,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:35,972 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) [2025-03-17 20:20:35,973 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 [2025-03-17 20:20:35,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:35,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:35,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:35,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:35,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:35,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:35,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:35,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:35,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:35,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-17 20:20:35,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:35,992 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) [2025-03-17 20:20:35,993 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 [2025-03-17 20:20:35,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 [2025-03-17 20:20:36,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:36,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:36,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:36,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-17 20:20:36,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,012 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) [2025-03-17 20:20:36,013 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 [2025-03-17 20:20:36,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:36,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:36,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:36,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,030 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 [2025-03-17 20:20:36,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,032 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) [2025-03-17 20:20:36,034 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 [2025-03-17 20:20:36,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-03-17 20:20:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,058 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) [2025-03-17 20:20:36,058 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 [2025-03-17 20:20:36,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,080 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 [2025-03-17 20:20:36,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,082 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) [2025-03-17 20:20:36,082 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 [2025-03-17 20:20:36,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,102 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 [2025-03-17 20:20:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,104 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) [2025-03-17 20:20:36,104 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 [2025-03-17 20:20:36,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,123 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 [2025-03-17 20:20:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,125 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) [2025-03-17 20:20:36,125 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 [2025-03-17 20:20:36,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,137 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-17 20:20:36,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,139 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-17 20:20:36,139 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,149 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 [2025-03-17 20:20:36,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,151 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) [2025-03-17 20:20:36,151 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 [2025-03-17 20:20:36,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,171 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 [2025-03-17 20:20:36,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,173 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) [2025-03-17 20:20:36,174 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 [2025-03-17 20:20:36,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:36,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:36,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:36,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,190 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 [2025-03-17 20:20:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,192 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) [2025-03-17 20:20:36,194 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 [2025-03-17 20:20:36,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,212 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 [2025-03-17 20:20:36,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,213 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) [2025-03-17 20:20:36,214 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 [2025-03-17 20:20:36,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:36,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:36,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:36,227 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:36,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,234 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) [2025-03-17 20:20:36,234 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 [2025-03-17 20:20:36,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,254 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 [2025-03-17 20:20:36,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,256 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) [2025-03-17 20:20:36,256 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 [2025-03-17 20:20:36,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:36,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,278 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) [2025-03-17 20:20:36,279 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 [2025-03-17 20:20:36,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:20:36,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:20:36,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:20:36,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,295 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 [2025-03-17 20:20:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,297 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) [2025-03-17 20:20:36,298 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 [2025-03-17 20:20:36,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,313 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,318 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 [2025-03-17 20:20:36,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,320 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) [2025-03-17 20:20:36,320 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 [2025-03-17 20:20:36,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,339 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 [2025-03-17 20:20:36,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,341 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) [2025-03-17 20:20:36,342 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 [2025-03-17 20:20:36,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 20:20:36,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:20:36,360 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 [2025-03-17 20:20:36,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,362 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) [2025-03-17 20:20:36,363 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 [2025-03-17 20:20:36,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 [2025-03-17 20:20:36,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:20:36,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:20:36,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:20:36,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:20:36,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 20:20:36,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 20:20:36,382 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:20:36,390 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-17 20:20:36,390 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-17 20:20:36,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:20:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:20:36,392 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) [2025-03-17 20:20:36,394 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 [2025-03-17 20:20:36,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:20:36,404 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 20:20:36,404 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:20:36,404 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0#1) = 1*ULTIMATE.start_parse_expression_list_~j~0#1 Supporting invariants [] [2025-03-17 20:20:36,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:36,431 INFO L156 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2025-03-17 20:20:36,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:36,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 20:20:36,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 20:20:36,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:36,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:36,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:20:36,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:36,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:20:36,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:20:36,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:36,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:36,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 20:20:36,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:20:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 20:20:36,548 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 [2025-03-17 20:20:36,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 156 transitions. cyclomatic complexity: 47 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:36,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 156 transitions. cyclomatic complexity: 47. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 239 transitions. Complement of second has 9 states. [2025-03-17 20:20:36,615 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 [2025-03-17 20:20:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-03-17 20:20:36,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 26 letters. Loop has 5 letters. [2025-03-17 20:20:36,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:36,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 31 letters. Loop has 5 letters. [2025-03-17 20:20:36,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:36,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 26 letters. Loop has 10 letters. [2025-03-17 20:20:36,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:20:36,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 239 transitions. [2025-03-17 20:20:36,617 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:36,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 140 states and 181 transitions. [2025-03-17 20:20:36,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-03-17 20:20:36,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-03-17 20:20:36,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 181 transitions. [2025-03-17 20:20:36,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:20:36,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 181 transitions. [2025-03-17 20:20:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 181 transitions. [2025-03-17 20:20:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2025-03-17 20:20:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.314516129032258) internal successors, (163), 123 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2025-03-17 20:20:36,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 163 transitions. [2025-03-17 20:20:36,624 INFO L432 stractBuchiCegarLoop]: Abstraction has 124 states and 163 transitions. [2025-03-17 20:20:36,624 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-17 20:20:36,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 163 transitions. [2025-03-17 20:20:36,624 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-03-17 20:20:36,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:20:36,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:20:36,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:20:36,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 20:20:36,625 INFO L752 eck$LassoCheckResult]: Stem: "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(43, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet21#1, main_#t~post22#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume main_~i~1#1 < 7;havoc main_#t~nondet21#1;call write~int#2(main_#t~nondet21#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet21#1;main_#t~post22#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1;" "assume !(main_~i~1#1 < 7);havoc main_~i~1#1;call write~int#2(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post2#1, parse_expression_list_#t~mem3#1, parse_expression_list_#t~switch4#1, parse_expression_list_#t~mem5#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~short7#1, parse_expression_list_#t~post8#1, parse_expression_list_#t~mem9#1, parse_expression_list_#t~post10#1, parse_expression_list_#t~mem11#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~short13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~post15#1, parse_expression_list_#t~mem16#1, parse_expression_list_#t~short17#1, parse_expression_list_#t~post18#1, parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset, parse_expression_list_#t~mem20#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2);" "assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0);" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume !parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;" "call parse_expression_list_#t~mem9#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);" "assume !(34 == parse_expression_list_#t~mem9#1);havoc parse_expression_list_#t~mem9#1;" "parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1;" "assume true;parse_expression_list_#t~short14#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short14#1;" "assume !parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~mem11#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~short13#1;havoc parse_expression_list_#t~short14#1;" "parse_expression_list_#t~short17#1 := 0 < parse_expression_list_~j~0#1;" "assume !parse_expression_list_#t~short17#1;" "assume !parse_expression_list_#t~short17#1;havoc parse_expression_list_#t~mem16#1;havoc parse_expression_list_#t~short17#1;" "assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1;assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset;" "parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~nondet1#1.base, r_strncpy_#t~nondet1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;havoc r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret19#1.base, parse_expression_list_#t~ret19#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;call write~int#1(0, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset + (1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1)), 1);parse_expression_list_~start~0#1 := 1 + parse_expression_list_~i~0#1;" "havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;havoc parse_expression_list_#t~mem3#1;havoc parse_expression_list_#t~switch4#1;call parse_expression_list_#t~mem20#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);" "assume 0 != parse_expression_list_#t~mem20#1;havoc parse_expression_list_#t~mem20#1;" "assume true;parse_expression_list_#t~post2#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post2#1;havoc parse_expression_list_#t~post2#1;call parse_expression_list_#t~mem3#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch4#1 := 0 == parse_expression_list_#t~mem3#1;" "assume parse_expression_list_#t~switch4#1;" [2025-03-17 20:20:36,625 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call parse_expression_list_#t~mem5#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 32 == parse_expression_list_#t~mem5#1;" "assume !parse_expression_list_#t~short7#1;call parse_expression_list_#t~mem6#1 := read~int#2(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short7#1 := 9 == parse_expression_list_#t~mem6#1;" "assume parse_expression_list_#t~short7#1;havoc parse_expression_list_#t~mem5#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~short7#1;parse_expression_list_#t~post8#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post8#1;" [2025-03-17 20:20:36,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1207803440, now seen corresponding path program 1 times [2025-03-17 20:20:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114165163] [2025-03-17 20:20:36,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:20:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 20:20:36,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 20:20:36,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:36,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:20:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 20:20:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:20:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114165163] [2025-03-17 20:20:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114165163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:20:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:20:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 20:20:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876335917] [2025-03-17 20:20:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:20:36,708 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:20:36,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:20:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash 79376, now seen corresponding path program 3 times [2025-03-17 20:20:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:20:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507121177] [2025-03-17 20:20:36,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 20:20:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:20:36,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:36,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:36,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 20:20:36,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:36,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:20:36,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:20:36,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:20:36,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:20:36,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:20:36,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:20:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:20:36,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 20:20:36,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 20:20:36,767 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. cyclomatic complexity: 49 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:20:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:20:36,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-03-17 20:20:36,822 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2025-03-17 20:20:36,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 106 transitions. [2025-03-17 20:20:36,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:20:36,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2025-03-17 20:20:36,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:20:36,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:20:36,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:20:36,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:20:36,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:36,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 20:20:36,824 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:20:36,824 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-17 20:20:36,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:20:36,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:20:36,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:20:36,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:20:36 BoogieIcfgContainer [2025-03-17 20:20:36,829 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:20:36,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:20:36,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:20:36,830 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:20:36,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:20:17" (3/4) ... [2025-03-17 20:20:36,832 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:20:36,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:20:36,833 INFO L158 Benchmark]: Toolchain (without parser) took 20003.71ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.8MB in the beginning and 147.6MB in the end (delta: -24.8MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2025-03-17 20:20:36,833 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:36,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.89ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 110.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 20:20:36,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.76ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:36,834 INFO L158 Benchmark]: Boogie Preprocessor took 32.15ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 107.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:36,834 INFO L158 Benchmark]: IcfgBuilder took 296.25ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 90.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:20:36,834 INFO L158 Benchmark]: BuchiAutomizer took 19459.24ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.0MB in the beginning and 149.4MB in the end (delta: -59.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:36,834 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 201.3MB. Free memory was 149.4MB in the beginning and 147.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:20:36,835 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.20ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.89ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 110.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.76ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.15ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 107.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 296.25ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 90.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 19459.24ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 90.0MB in the beginning and 149.4MB in the end (delta: -59.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 201.3MB. Free memory was 149.4MB in the beginning and 147.6MB in the end (delta: 1.8MB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~str!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (10 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function j and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 15 iterations. TraceHistogramMax:7. Analysis of lassos took 18.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 7 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 527 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 379 mSDtfsCounter, 527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital184 mio100 ax100 hnf100 lsp89 ukn68 mio100 lsp31 div100 bol100 ite100 ukn100 eq172 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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! [2025-03-17 20:20:36,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-03-17 20:20:37,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 20:20:37,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 20:20:37,451 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