./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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/array-memsafety/openbsd_cstpcpy-alloca-1.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 f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:45:36,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:45:36,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:45:36,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:45:36,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:45:36,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:45:36,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:45:36,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:45:36,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:45:36,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:45:36,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:45:36,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:45:36,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:45:36,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:45:36,228 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:45:36,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:45:36,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:45:36,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:45:36,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:45:36,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:45:36,230 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:45:36,230 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 -> f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 [2025-03-04 15:45:36,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:45:36,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:45:36,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:45:36,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:45:36,448 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:45:36,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2025-03-04 15:45:37,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db4bd0fe/ef0434a7eac64390aa7f4ea521acc87e/FLAGe01348d01 [2025-03-04 15:45:37,819 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:45:37,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2025-03-04 15:45:37,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db4bd0fe/ef0434a7eac64390aa7f4ea521acc87e/FLAGe01348d01 [2025-03-04 15:45:37,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db4bd0fe/ef0434a7eac64390aa7f4ea521acc87e [2025-03-04 15:45:37,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:45:37,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:45:37,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:45:37,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:45:37,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:45:37,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:45:37" (1/1) ... [2025-03-04 15:45:37,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5570650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:37, skipping insertion in model container [2025-03-04 15:45:37,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:45:37" (1/1) ... [2025-03-04 15:45:37,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:45:38,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:45:38,059 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:45:38,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:45:38,102 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:45:38,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38 WrapperNode [2025-03-04 15:45:38,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:45:38,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:45:38,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:45:38,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:45:38,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,127 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-04 15:45:38,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:45:38,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:45:38,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:45:38,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:45:38,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,145 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [3, 1]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2025-03-04 15:45:38,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:45:38,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:45:38,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:45:38,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:45:38,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (1/1) ... [2025-03-04 15:45:38,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:38,174 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-04 15:45:38,176 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-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:45:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:45:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:45:38,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:45:38,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:45:38,363 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: call ULTIMATE.dealloc(main_#t~malloc7#1.base, main_#t~malloc7#1.offset);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; [2025-03-04 15:45:38,371 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 15:45:38,371 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:45:38,379 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:45:38,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:45:38,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:45:38 BoogieIcfgContainer [2025-03-04 15:45:38,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:45:38,381 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:45:38,381 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:45:38,385 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:45:38,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:45:38,386 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:45:37" (1/3) ... [2025-03-04 15:45:38,387 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5944b63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:45:38, skipping insertion in model container [2025-03-04 15:45:38,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:45:38,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:45:38" (2/3) ... [2025-03-04 15:45:38,388 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5944b63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:45:38, skipping insertion in model container [2025-03-04 15:45:38,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:45:38,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:45:38" (3/3) ... [2025-03-04 15:45:38,390 INFO L363 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-1.i [2025-03-04 15:45:38,424 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:45:38,425 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:45:38,425 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:45:38,425 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:45:38,427 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:45:38,427 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:45:38,427 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:45:38,427 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:45:38,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:38,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-04 15:45:38,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:38,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:38,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:45:38,443 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:45:38,444 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:45:38,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:38,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2025-03-04 15:45:38,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:38,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:38,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:45:38,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-04 15:45:38,449 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet5#1;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" [2025-03-04 15:45:38,449 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~length2~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-03-04 15:45:38,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 51500628, now seen corresponding path program 1 times [2025-03-04 15:45:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264348486] [2025-03-04 15:45:38,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:38,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:45:38,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:45:38,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:38,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:38,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:38,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:45:38,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:45:38,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:38,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:38,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:38,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-03-04 15:45:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:38,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949094263] [2025-03-04 15:45:38,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:38,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:38,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:38,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:38,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:38,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:38,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:38,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:38,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:38,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:38,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1596519481, now seen corresponding path program 1 times [2025-03-04 15:45:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:38,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721633176] [2025-03-04 15:45:38,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:38,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:38,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:38,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:38,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:38,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:38,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:38,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:38,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:38,940 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:38,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:38,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:38,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:38,941 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:38,941 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:38,941 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:38,941 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:38,941 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration1_Lasso [2025-03-04 15:45:38,941 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:38,941 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:38,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:38,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:39,362 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:39,364 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:39,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,367 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-04 15:45:39,369 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-04 15:45:39,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,393 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-04 15:45:39,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,396 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-04 15:45:39,397 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-04 15:45:39,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,420 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-04 15:45:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,423 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-04 15:45:39,425 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-04 15:45:39,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,447 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-04 15:45:39,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,449 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-04 15:45:39,451 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-04 15:45:39,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:39,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,474 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-04 15:45:39,475 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-04 15:45:39,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:39,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:39,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,496 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-04 15:45:39,498 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-04 15:45:39,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,518 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-04 15:45:39,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,520 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-04 15:45:39,521 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-04 15:45:39,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:39,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,541 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-04 15:45:39,542 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-04 15:45:39,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:39,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,562 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-04 15:45:39,563 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-04 15:45:39,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,582 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-04 15:45:39,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,584 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-04 15:45:39,584 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-04 15:45:39,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:39,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,607 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-04 15:45:39,607 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-04 15:45:39,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:39,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,625 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-04 15:45:39,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,628 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-04 15:45:39,630 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-04 15:45:39,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,650 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-04 15:45:39,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,652 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-04 15:45:39,653 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-04 15:45:39,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,672 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-04 15:45:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,675 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-04 15:45:39,677 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-04 15:45:39,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,694 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-04 15:45:39,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,697 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:45:39,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:45:39,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:45:39,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,720 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:45:39,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:45:39,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-04 15:45:39,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,747 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-04 15:45:39,748 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-04 15:45:39,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,772 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-04 15:45:39,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,774 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-04 15:45:39,774 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-04 15:45:39,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,795 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-04 15:45:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,797 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-04 15:45:39,798 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-04 15:45:39,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:39,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,824 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-04 15:45:39,826 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-04 15:45:39,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:39,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:39,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:39,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:39,845 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-04 15:45:39,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,847 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-04 15:45:39,848 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-04 15:45:39,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:39,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:39,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:39,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:39,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:39,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:39,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:39,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:39,907 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:45:39,909 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:45:39,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:39,914 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-04 15:45:39,915 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-04 15:45:39,918 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:39,929 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:39,929 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:39,930 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~nondetString~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~nondetString~0#1.offset Supporting invariants [] [2025-03-04 15:45:39,936 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-04 15:45:39,952 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-04 15:45:39,958 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~nondetString~0!offset [2025-03-04 15:45:39,960 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:45:39,960 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:45:39,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:45:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:45:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:40,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:45:40,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:40,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-04 15:45:40,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-04 15:45:40,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:40,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:45:40,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:40,033 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-04 15:45:40,056 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-04 15:45:40,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:40,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 24 transitions. Complement of second has 3 states. [2025-03-04 15:45:40,096 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-04 15:45:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2025-03-04 15:45:40,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 5 letters. Loop has 1 letters. [2025-03-04 15:45:40,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:40,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2025-03-04 15:45:40,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:40,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-04 15:45:40,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:40,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-04 15:45:40,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:40,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 14 transitions. [2025-03-04 15:45:40,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:40,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:45:40,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2025-03-04 15:45:40,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:40,107 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 14 transitions. [2025-03-04 15:45:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2025-03-04 15:45:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-04 15:45:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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-04 15:45:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2025-03-04 15:45:40,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:45:40,123 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2025-03-04 15:45:40,123 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:45:40,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2025-03-04 15:45:40,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:40,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:40,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:40,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:45:40,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:40,124 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet5#1;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~length2~0#1);havoc main_~i~0#1;call write~int#0(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~mem2#1, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset;" [2025-03-04 15:45:40,124 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstpcpy_#t~mem2#1 := read~int#0(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int#1(cstpcpy_#t~mem2#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1);" "assume 0 != cstpcpy_#t~mem2#1;havoc cstpcpy_#t~mem2#1;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset;cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset;" [2025-03-04 15:45:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1596519480, now seen corresponding path program 1 times [2025-03-04 15:45:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588138014] [2025-03-04 15:45:40,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:45:40,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:45:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:40,216 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-04 15:45:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588138014] [2025-03-04 15:45:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588138014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:45:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:45:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:45:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896302656] [2025-03-04 15:45:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:45:40,219 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:45:40,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 1 times [2025-03-04 15:45:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509109193] [2025-03-04 15:45:40,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:40,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:40,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:40,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:40,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:40,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:45:40,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:45:40,317 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:40,331 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2025-03-04 15:45:40,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 12 transitions. [2025-03-04 15:45:40,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:40,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 12 transitions. [2025-03-04 15:45:40,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:45:40,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:45:40,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-03-04 15:45:40,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:40,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 15:45:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-03-04 15:45:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-04 15:45:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 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-04 15:45:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-03-04 15:45:40,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 15:45:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:45:40,333 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 15:45:40,333 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:45:40,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-03-04 15:45:40,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:40,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:40,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:40,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:40,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:40,334 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet5#1;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length2~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~length2~0#1);havoc main_~i~0#1;call write~int#0(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~mem2#1, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset;" [2025-03-04 15:45:40,334 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstpcpy_#t~mem2#1 := read~int#0(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int#1(cstpcpy_#t~mem2#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1);" "assume 0 != cstpcpy_#t~mem2#1;havoc cstpcpy_#t~mem2#1;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset;cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset;" [2025-03-04 15:45:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2047503629, now seen corresponding path program 1 times [2025-03-04 15:45:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182827064] [2025-03-04 15:45:40,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:45:40,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:45:40,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:40,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:45:40,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:45:40,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:40,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 2 times [2025-03-04 15:45:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19846615] [2025-03-04 15:45:40,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:40,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:40,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:45:40,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:40,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:40,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:40,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -555965582, now seen corresponding path program 1 times [2025-03-04 15:45:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607445907] [2025-03-04 15:45:40,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:40,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:40,579 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-04 15:45:40,625 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-04 15:45:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:45:40,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607445907] [2025-03-04 15:45:40,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607445907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:45:40,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504060307] [2025-03-04 15:45:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:45:40,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:45:40,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:40,627 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:45:40,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 15:45:40,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:45:40,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:45:40,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:40,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:45:40,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:40,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:45:40,726 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-04 15:45:40,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:45:40,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-04 15:45:40,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:45:40,782 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-04 15:45:40,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504060307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:45:40,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:45:40,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 15:45:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190847987] [2025-03-04 15:45:40,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:45:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:45:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:45:40,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:45:40,847 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:45:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:45:40,910 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-03-04 15:45:40,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-03-04 15:45:40,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:40,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 14 transitions. [2025-03-04 15:45:40,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:45:40,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:45:40,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2025-03-04 15:45:40,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:40,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-03-04 15:45:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2025-03-04 15:45:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-04 15:45:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04 15:45:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2025-03-04 15:45:40,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-04 15:45:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:45:40,912 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2025-03-04 15:45:40,912 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:45:40,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2025-03-04 15:45:40,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-04 15:45:40,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:45:40,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:45:40,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:45:40,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-04 15:45:40,912 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc main_#t~nondet5#1;main_~length1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~length2~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "assume !(main_~length1~0#1 < main_~length2~0#1);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~length2~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~length2~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~length2~0#1);havoc main_~i~0#1;call write~int#0(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstpcpy } true;cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset, cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;havoc cstpcpy_#res#1.base, cstpcpy_#res#1.offset;havoc cstpcpy_#t~mem2#1, cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset, cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, cstpcpy_~from#1.base, cstpcpy_~from#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_#in~to#1.base, cstpcpy_#in~to#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_#in~from#1.base, cstpcpy_#in~from#1.offset;" [2025-03-04 15:45:40,912 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstpcpy_#t~mem2#1 := read~int#0(cstpcpy_~from#1.base, cstpcpy_~from#1.offset, 1);call write~int#1(cstpcpy_#t~mem2#1, cstpcpy_~to#1.base, cstpcpy_~to#1.offset, 1);" "assume 0 != cstpcpy_#t~mem2#1;havoc cstpcpy_#t~mem2#1;cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;cstpcpy_~from#1.base, cstpcpy_~from#1.offset := cstpcpy_~from#1.base, 1 + cstpcpy_~from#1.offset;havoc cstpcpy_#t~pre3#1.base, cstpcpy_#t~pre3#1.offset;cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;cstpcpy_~to#1.base, cstpcpy_~to#1.offset := cstpcpy_~to#1.base, 1 + cstpcpy_~to#1.offset;havoc cstpcpy_#t~pre4#1.base, cstpcpy_#t~pre4#1.offset;" [2025-03-04 15:45:40,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 951896984, now seen corresponding path program 2 times [2025-03-04 15:45:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480249033] [2025-03-04 15:45:40,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 15:45:40,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:45:40,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:40,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:40,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:45:40,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:45:40,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:40,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 3 times [2025-03-04 15:45:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705047404] [2025-03-04 15:45:40,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:45:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:40,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:40,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:45:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:40,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:40,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash -55032105, now seen corresponding path program 2 times [2025-03-04 15:45:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:45:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881815320] [2025-03-04 15:45:40,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:45:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:45:40,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 15:45:40,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:45:40,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:45:40,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:45:40,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:45:40,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:45:40,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:40,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:45:40,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:45:41,516 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:45:41,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:45:41,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:45:41,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:45:41,517 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:45:41,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:41,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:45:41,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:45:41,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca-1.i_Iteration4_Lasso [2025-03-04 15:45:41,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:45:41,517 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:45:41,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:41,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:45:42,042 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:45:42,042 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:45:42,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,045 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-04 15:45:42,046 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-04 15:45:42,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:42,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:42,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:42,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:42,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:42,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:42,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:42,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:42,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:42,066 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-04 15:45:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,069 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-04 15:45:42,070 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-04 15:45:42,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:45:42,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:42,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:42,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:42,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:42,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:42,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:42,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:42,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:42,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:42,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,093 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-04 15:45:42,095 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-04 15:45:42,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:42,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:42,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:42,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:42,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:42,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:42,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:42,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:42,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:42,114 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-04 15:45:42,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,116 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-04 15:45:42,117 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-04 15:45:42,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-04 15:45:42,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:42,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:42,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:42,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:42,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:42,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:42,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:42,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:42,137 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-04 15:45:42,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,139 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-04 15:45:42,141 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-04 15:45:42,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:42,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:42,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:45:42,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:42,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:42,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:42,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:45:42,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:45:42,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:45:42,162 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-04 15:45:42,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,165 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-04 15:45:42,169 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-04 15:45:42,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-04 15:45:42,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:45:42,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:45:42,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:45:42,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:45:42,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:45:42,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:45:42,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:45:42,213 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-04 15:45:42,214 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-04 15:45:42,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:45:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:45:42,217 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-04 15:45:42,218 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-04 15:45:42,218 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:45:42,230 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:45:42,230 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:45:42,230 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpcpy_~to#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc7#1.base)_2) = -1*ULTIMATE.start_cstpcpy_~to#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7#1.base)_2 Supporting invariants [] [2025-03-04 15:45:42,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:45:42,261 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2025-03-04 15:45:42,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~to!offset [2025-03-04 15:45:42,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-04 15:45:42,263 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-04 15:45:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:45:42,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:45:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:45:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:42,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:42,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:45:42,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:45:42,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:45:42,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:45:42,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:45:42,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:45:42,350 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-04 15:45:42,351 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-04 15:45:42,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-04 15:45:42,379 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Result 12 states and 16 transitions. Complement of second has 5 states. [2025-03-04 15:45:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:45:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-04 15:45:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-03-04 15:45:42,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2025-03-04 15:45:42,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:42,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-04 15:45:42,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:42,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-04 15:45:42,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:45:42,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2025-03-04 15:45:42,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:45:42,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2025-03-04 15:45:42,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:45:42,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:45:42,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:45:42,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:45:42,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:45:42,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:45:42,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:45:42,381 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:45:42,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:45:42,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:45:42,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:45:42,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:45:42 BoogieIcfgContainer [2025-03-04 15:45:42,388 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:45:42,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:45:42,388 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:45:42,388 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:45:42,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:45:38" (3/4) ... [2025-03-04 15:45:42,390 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:45:42,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:45:42,392 INFO L158 Benchmark]: Toolchain (without parser) took 4546.82ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 57.0MB in the end (delta: 55.3MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2025-03-04 15:45:42,393 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:45:42,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.25ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:45:42,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.05ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:45:42,394 INFO L158 Benchmark]: Boogie Preprocessor took 24.15ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:45:42,394 INFO L158 Benchmark]: IcfgBuilder took 228.10ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 80.4MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:45:42,394 INFO L158 Benchmark]: BuchiAutomizer took 4006.23ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 58.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-03-04 15:45:42,394 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 57.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:45:42,395 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.25ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 95.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.05ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.15ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 228.10ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 80.4MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4006.23ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 58.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 57.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~nondetString~0!offset - 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: ~to!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 4 terminating modules (2 trivial, 2 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 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 33 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax112 hnf100 lsp87 ukn81 mio100 lsp35 div138 bol100 ite100 ukn100 eq162 hnf91 smp85 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:45:42,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:42,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 15:45:42,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE