./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.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 bfd8ca9d9dda86f57445168715d124831c95b647e7c1b1093bb129b0384cce9e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 22:20:32,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 22:20:32,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-20 22:20:32,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 22:20:32,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 22:20:32,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 22:20:32,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 22:20:32,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 22:20:32,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 22:20:32,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 22:20:32,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 22:20:32,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 22:20:32,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 22:20:32,746 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-20 22:20:32,746 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-20 22:20:32,746 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-20 22:20:32,746 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-20 22:20:32,747 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-20 22:20:32,747 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-20 22:20:32,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 22:20:32,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-20 22:20:32,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 22:20:32,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 22:20:32,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 22:20:32,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 22:20:32,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-20 22:20:32,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-20 22:20:32,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-20 22:20:32,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 22:20:32,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 22:20:32,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 22:20:32,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 22:20:32,753 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-20 22:20:32,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 22:20:32,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 22:20:32,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 22:20:32,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 22:20:32,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 22:20:32,755 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-20 22:20:32,756 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfd8ca9d9dda86f57445168715d124831c95b647e7c1b1093bb129b0384cce9e [2024-11-20 22:20:33,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 22:20:33,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 22:20:33,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 22:20:33,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 22:20:33,047 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 22:20:33,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2024-11-20 22:20:34,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 22:20:34,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 22:20:34,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2024-11-20 22:20:34,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6876118f5/fe711d20b07f47a980cce31503dfa442/FLAG9898ac4fd [2024-11-20 22:20:35,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6876118f5/fe711d20b07f47a980cce31503dfa442 [2024-11-20 22:20:35,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 22:20:35,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 22:20:35,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 22:20:35,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 22:20:35,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 22:20:35,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209d1258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35, skipping insertion in model container [2024-11-20 22:20:35,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 22:20:35,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:20:35,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 22:20:35,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 22:20:35,574 INFO L204 MainTranslator]: Completed translation [2024-11-20 22:20:35,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35 WrapperNode [2024-11-20 22:20:35,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 22:20:35,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 22:20:35,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 22:20:35,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 22:20:35,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,621 INFO L138 Inliner]: procedures = 117, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2024-11-20 22:20:35,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 22:20:35,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 22:20:35,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 22:20:35,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 22:20:35,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,656 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [2, 3]. [2024-11-20 22:20:35,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 22:20:35,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 22:20:35,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 22:20:35,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 22:20:35,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (1/1) ... [2024-11-20 22:20:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:35,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:35,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:35,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-20 22:20:35,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 22:20:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 22:20:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 22:20:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 22:20:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 22:20:35,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 22:20:35,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 22:20:35,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 22:20:35,915 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 22:20:35,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 22:20:36,124 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-20 22:20:36,124 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 22:20:36,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 22:20:36,140 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-20 22:20:36,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:36 BoogieIcfgContainer [2024-11-20 22:20:36,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 22:20:36,143 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-20 22:20:36,143 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-20 22:20:36,147 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-20 22:20:36,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:20:36,148 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 10:20:35" (1/3) ... [2024-11-20 22:20:36,149 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30814021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:20:36, skipping insertion in model container [2024-11-20 22:20:36,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:20:36,149 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:35" (2/3) ... [2024-11-20 22:20:36,150 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30814021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 10:20:36, skipping insertion in model container [2024-11-20 22:20:36,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-20 22:20:36,150 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:36" (3/3) ... [2024-11-20 22:20:36,152 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2024-11-20 22:20:36,207 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-20 22:20:36,208 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-20 22:20:36,209 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-20 22:20:36,209 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-20 22:20:36,209 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-20 22:20:36,209 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-20 22:20:36,210 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-20 22:20:36,210 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-20 22:20:36,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:36,235 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:36,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:36,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:36,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:20:36,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:36,243 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-20 22:20:36,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:36,246 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-20 22:20:36,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:36,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:36,246 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-20 22:20:36,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:36,255 INFO L745 eck$LassoCheckResult]: Stem: 17#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet12#1, main_#t~post13#1, main_~i~0#1, main_#t~nondet14#1, main_#t~post15#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet7#1;main_~length1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 11#L527true assume !(main_~length1~0#1 < 1); 14#L527-2true assume !(main_~length2~0#1 < 2); 15#L530-1true assume !(main_~length3~0#1 < 1); 10#L533-1true assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 7#L540-3true [2024-11-20 22:20:36,256 INFO L747 eck$LassoCheckResult]: Loop: 7#L540-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet12#1;call write~int#0(main_#t~nondet12#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet12#1; 13#L540-2true main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 7#L540-3true [2024-11-20 22:20:36,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:36,262 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2024-11-20 22:20:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:36,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001736280] [2024-11-20 22:20:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:36,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:36,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2024-11-20 22:20:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132417875] [2024-11-20 22:20:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:36,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:36,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2024-11-20 22:20:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826916275] [2024-11-20 22:20:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:36,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:36,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:37,012 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:20:37,014 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:20:37,014 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:20:37,014 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:20:37,014 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:20:37,014 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:37,014 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:20:37,015 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:20:37,015 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2024-11-20 22:20:37,015 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:20:37,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:20:37,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:37,669 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:20:37,673 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:20:37,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:37,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:37,678 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) [2024-11-20 22:20:37,679 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 [2024-11-20 22:20:37,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:37,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:37,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:37,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:37,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:37,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:37,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:37,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:37,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:37,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:37,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:37,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:37,710 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) [2024-11-20 22:20:37,712 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 [2024-11-20 22:20:37,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:37,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:37,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:37,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:37,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:37,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:37,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:37,750 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:20:37,811 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-20 22:20:37,811 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2024-11-20 22:20:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:37,840 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) [2024-11-20 22:20:37,841 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 [2024-11-20 22:20:37,843 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:20:37,855 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:20:37,855 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:20:37,856 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length1~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-20 22:20:37,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-20 22:20:37,889 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-20 22:20:37,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:37,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:20:37,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:37,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:20:37,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:38,044 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:20:38,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:38,100 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 57 transitions. Complement of second has 6 states. [2024-11-20 22:20:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:20:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2024-11-20 22:20:38,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-20 22:20:38,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:38,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-20 22:20:38,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:38,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-20 22:20:38,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:38,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2024-11-20 22:20:38,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:38,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 26 transitions. [2024-11-20 22:20:38,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-20 22:20:38,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-20 22:20:38,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2024-11-20 22:20:38,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:38,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-20 22:20:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2024-11-20 22:20:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-20 22:20:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2024-11-20 22:20:38,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-20 22:20:38,154 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-20 22:20:38,154 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-20 22:20:38,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2024-11-20 22:20:38,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:38,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:38,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:38,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:38,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:38,156 INFO L745 eck$LassoCheckResult]: Stem: 148#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet12#1, main_#t~post13#1, main_~i~0#1, main_#t~nondet14#1, main_#t~post15#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet7#1;main_~length1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 142#L527 assume !(main_~length1~0#1 < 1); 146#L527-2 assume !(main_~length2~0#1 < 2); 147#L530-1 assume !(main_~length3~0#1 < 1); 145#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 137#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 139#L540-4 havoc main_~i~0#1;main_~i~1#1 := 0; 132#L545-3 [2024-11-20 22:20:38,157 INFO L747 eck$LassoCheckResult]: Loop: 132#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet14#1; 134#L545-2 main_#t~post15#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 132#L545-3 [2024-11-20 22:20:38,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2024-11-20 22:20:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:38,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194879038] [2024-11-20 22:20:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:38,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:38,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:38,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2024-11-20 22:20:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139374348] [2024-11-20 22:20:38,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:38,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:38,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:38,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:38,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2024-11-20 22:20:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812742626] [2024-11-20 22:20:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:38,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:38,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:38,553 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:20:38,554 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:20:38,554 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:20:38,554 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:20:38,554 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:20:38,554 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:38,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:20:38,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:20:38,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2024-11-20 22:20:38,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:20:38,555 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:20:38,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:38,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:39,039 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:20:39,039 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:20:39,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,042 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) [2024-11-20 22:20:39,044 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 [2024-11-20 22:20:39,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:39,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:39,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:39,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:39,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:39,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:39,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:39,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:39,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:39,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-20 22:20:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,074 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) [2024-11-20 22:20:39,075 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 [2024-11-20 22:20:39,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:39,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:39,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:39,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:39,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:39,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:39,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:39,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:39,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-20 22:20:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,110 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) [2024-11-20 22:20:39,114 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 [2024-11-20 22:20:39,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:39,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:39,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:39,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:39,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:39,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:39,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:39,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:39,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:39,145 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 [2024-11-20 22:20:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:39,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-20 22:20:39,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:39,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:39,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:39,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:39,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:39,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:39,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:39,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:39,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-20 22:20:39,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:39,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-20 22:20:39,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:39,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:39,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:39,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:39,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:39,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:39,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:39,203 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:39,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:39,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:39,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-20 22:20:39,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:39,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:39,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:39,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:39,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:39,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:39,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:39,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:20:39,320 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-20 22:20:39,320 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-20 22:20:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:39,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:39,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-20 22:20:39,330 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 [2024-11-20 22:20:39,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:20:39,348 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:20:39,348 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:20:39,348 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~length2~0#1) = -1*ULTIMATE.start_main_~i~1#1 + 1*ULTIMATE.start_main_~length2~0#1 Supporting invariants [] [2024-11-20 22:20:39,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-20 22:20:39,376 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-20 22:20:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:39,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:20:39,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:39,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 22:20:39,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:39,448 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:20:39,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:39,474 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 38 transitions. Complement of second has 6 states. [2024-11-20 22:20:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-20 22:20:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-20 22:20:39,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-20 22:20:39,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:39,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-20 22:20:39,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:39,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-20 22:20:39,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:39,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 38 transitions. [2024-11-20 22:20:39,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-20 22:20:39,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 27 transitions. [2024-11-20 22:20:39,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-20 22:20:39,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-20 22:20:39,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2024-11-20 22:20:39,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:39,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-20 22:20:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2024-11-20 22:20:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-20 22:20:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2024-11-20 22:20:39,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-20 22:20:39,484 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-20 22:20:39,484 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-20 22:20:39,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2024-11-20 22:20:39,485 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-20 22:20:39,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:39,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:39,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:39,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:39,486 INFO L745 eck$LassoCheckResult]: Stem: 265#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet12#1, main_#t~post13#1, main_~i~0#1, main_#t~nondet14#1, main_#t~post15#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet7#1;main_~length1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 261#L527 assume !(main_~length1~0#1 < 1); 263#L527-2 assume !(main_~length2~0#1 < 2); 264#L530-1 assume !(main_~length3~0#1 < 1); 262#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 254#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 256#L540-4 havoc main_~i~0#1;main_~i~1#1 := 0; 248#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 249#L545-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~mem2#1, cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 259#L517-3 [2024-11-20 22:20:39,486 INFO L747 eck$LassoCheckResult]: Loop: 259#L517-3 call cstrcat_#t~mem2#1 := read~int#1(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 258#L517-1 assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset; 259#L517-3 [2024-11-20 22:20:39,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2024-11-20 22:20:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:39,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527332154] [2024-11-20 22:20:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:39,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527332154] [2024-11-20 22:20:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527332154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:20:39,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:20:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 22:20:39,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564949986] [2024-11-20 22:20:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:20:39,607 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-20 22:20:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2024-11-20 22:20:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596310743] [2024-11-20 22:20:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:39,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:39,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 22:20:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 22:20:39,666 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:39,691 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2024-11-20 22:20:39,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2024-11-20 22:20:39,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-20 22:20:39,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2024-11-20 22:20:39,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-20 22:20:39,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-20 22:20:39,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-11-20 22:20:39,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:39,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-20 22:20:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-11-20 22:20:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-20 22:20:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2024-11-20 22:20:39,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-20 22:20:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 22:20:39,696 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-20 22:20:39,696 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-20 22:20:39,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2024-11-20 22:20:39,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-20 22:20:39,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:39,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:39,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:39,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:39,698 INFO L745 eck$LassoCheckResult]: Stem: 309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet12#1, main_#t~post13#1, main_~i~0#1, main_#t~nondet14#1, main_#t~post15#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet7#1;main_~length1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 301#L527 assume !(main_~length1~0#1 < 1); 307#L527-2 assume !(main_~length2~0#1 < 2); 308#L530-1 assume !(main_~length3~0#1 < 1); 306#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 302#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 304#L540-4 havoc main_~i~0#1;main_~i~1#1 := 0; 292#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet14#1; 293#L545-2 main_#t~post15#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 294#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 295#L545-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~mem2#1, cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 299#L517-3 [2024-11-20 22:20:39,698 INFO L747 eck$LassoCheckResult]: Loop: 299#L517-3 call cstrcat_#t~mem2#1 := read~int#1(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 298#L517-1 assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset; 299#L517-3 [2024-11-20 22:20:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2024-11-20 22:20:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629111853] [2024-11-20 22:20:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:39,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:39,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2024-11-20 22:20:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690731547] [2024-11-20 22:20:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:39,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:39,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:39,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2024-11-20 22:20:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22621616] [2024-11-20 22:20:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:40,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22621616] [2024-11-20 22:20:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22621616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 22:20:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764580257] [2024-11-20 22:20:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:40,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 22:20:40,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:40,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 22:20:40,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 22:20:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:40,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 22:20:40,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:40,343 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 [2024-11-20 22:20:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:40,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 22:20:40,371 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 [2024-11-20 22:20:40,375 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 [2024-11-20 22:20:40,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-20 22:20:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764580257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 22:20:40,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 22:20:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-20 22:20:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5130537] [2024-11-20 22:20:40,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 22:20:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 22:20:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-20 22:20:40,561 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:40,835 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-20 22:20:40,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2024-11-20 22:20:40,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-20 22:20:40,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 48 transitions. [2024-11-20 22:20:40,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-20 22:20:40,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-20 22:20:40,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2024-11-20 22:20:40,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:40,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-20 22:20:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2024-11-20 22:20:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-20 22:20:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-11-20 22:20:40,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-20 22:20:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 22:20:40,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-20 22:20:40,840 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-20 22:20:40,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2024-11-20 22:20:40,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-20 22:20:40,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:40,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:40,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:40,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:40,842 INFO L745 eck$LassoCheckResult]: Stem: 484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet12#1, main_#t~post13#1, main_~i~0#1, main_#t~nondet14#1, main_#t~post15#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet7#1;main_~length1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 475#L527 assume !(main_~length1~0#1 < 1); 481#L527-2 assume !(main_~length2~0#1 < 2); 482#L530-1 assume main_~length3~0#1 < 1;main_~length3~0#1 := 1; 480#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 476#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 478#L540-4 havoc main_~i~0#1;main_~i~1#1 := 0; 467#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet14#1; 468#L545-2 main_#t~post15#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 469#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 470#L545-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~mem2#1, cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 485#L517-3 call cstrcat_#t~mem2#1 := read~int#1(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 473#L517-1 assume !(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1; 471#L519-2 [2024-11-20 22:20:40,842 INFO L747 eck$LassoCheckResult]: Loop: 471#L519-2 cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post4#1.base, 1 + cstrcat_#t~post4#1.offset;cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset := cstrcat_~s2#1.base, cstrcat_~s2#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#t~post5#1.base, 1 + cstrcat_#t~post5#1.offset;call cstrcat_#t~mem6#1 := read~int#0(cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, 1);call write~int#1(cstrcat_#t~mem6#1, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, 1); 472#L519 assume !!(0 != cstrcat_#t~mem6#1);havoc cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset;havoc cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset;havoc cstrcat_#t~mem6#1; 471#L519-2 [2024-11-20 22:20:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1505990522, now seen corresponding path program 1 times [2024-11-20 22:20:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632069886] [2024-11-20 22:20:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:40,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:40,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:40,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2024-11-20 22:20:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414846006] [2024-11-20 22:20:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:40,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:40,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:40,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 147089355, now seen corresponding path program 1 times [2024-11-20 22:20:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897417026] [2024-11-20 22:20:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 22:20:41,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 22:20:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897417026] [2024-11-20 22:20:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897417026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 22:20:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 22:20:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 22:20:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597827732] [2024-11-20 22:20:41,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 22:20:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 22:20:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 22:20:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 22:20:41,167 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 22:20:41,200 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-11-20 22:20:41,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2024-11-20 22:20:41,201 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:41,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 53 transitions. [2024-11-20 22:20:41,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-20 22:20:41,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-20 22:20:41,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-20 22:20:41,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:41,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-20 22:20:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-20 22:20:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-20 22:20:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.275) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-20 22:20:41,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-20 22:20:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 22:20:41,211 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-20 22:20:41,211 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-20 22:20:41,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2024-11-20 22:20:41,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-20 22:20:41,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-20 22:20:41,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-20 22:20:41,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 22:20:41,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-20 22:20:41,212 INFO L745 eck$LassoCheckResult]: Stem: 583#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~nondet12#1, main_#t~post13#1, main_~i~0#1, main_#t~nondet14#1, main_#t~post15#1, main_~i~1#1, main_#t~ret16#1.base, main_#t~ret16#1.offset, main_~length1~0#1, main_~length2~0#1, main_~length3~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet7#1;main_~length1~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~length2~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~length3~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 577#L527 assume !(main_~length1~0#1 < 1); 580#L527-2 assume !(main_~length2~0#1 < 2); 581#L530-1 assume !(main_~length3~0#1 < 1); 578#L533-1 assume !(main_~length2~0#1 - main_~length3~0#1 < main_~length1~0#1 || main_~length3~0#1 > main_~length2~0#1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;main_~i~0#1 := 0; 579#L540-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 592#L540-4 havoc main_~i~0#1;main_~i~1#1 := 0; 591#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet14#1; 590#L545-2 main_#t~post15#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 589#L545-3 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet14#1;call write~int#1(main_#t~nondet14#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet14#1; 588#L545-2 main_#t~post15#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 587#L545-3 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 586#L545-4 havoc main_~i~1#1;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length3~0#1 - 1), 1);assume { :begin_inline_cstrcat } true;cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset, cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;havoc cstrcat_#res#1.base, cstrcat_#res#1.offset;havoc cstrcat_#t~mem2#1, cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset, cstrcat_#t~post4#1.base, cstrcat_#t~post4#1.offset, cstrcat_#t~post5#1.base, cstrcat_#t~post5#1.offset, cstrcat_#t~mem6#1, cstrcat_~s1#1.base, cstrcat_~s1#1.offset, cstrcat_~s2#1.base, cstrcat_~s2#1.offset, cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s1#1.base, cstrcat_~s1#1.offset := cstrcat_#in~s1#1.base, cstrcat_#in~s1#1.offset;cstrcat_~s2#1.base, cstrcat_~s2#1.offset := cstrcat_#in~s2#1.base, cstrcat_#in~s2#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_~s1#1.base, cstrcat_~s1#1.offset; 575#L517-3 [2024-11-20 22:20:41,212 INFO L747 eck$LassoCheckResult]: Loop: 575#L517-3 call cstrcat_#t~mem2#1 := read~int#1(cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset, 1); 574#L517-1 assume !!(0 != cstrcat_#t~mem2#1);havoc cstrcat_#t~mem2#1;cstrcat_#t~post3#1.base, cstrcat_#t~post3#1.offset := cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset;cstrcat_~s~0#1.base, cstrcat_~s~0#1.offset := cstrcat_#t~post3#1.base, 1 + cstrcat_#t~post3#1.offset; 575#L517-3 [2024-11-20 22:20:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2024-11-20 22:20:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174119066] [2024-11-20 22:20:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:41,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:41,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:41,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2024-11-20 22:20:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:41,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531300466] [2024-11-20 22:20:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:41,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:41,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:41,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:41,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2024-11-20 22:20:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 22:20:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502946412] [2024-11-20 22:20:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 22:20:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 22:20:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:41,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 22:20:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 22:20:41,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 22:20:42,028 INFO L204 LassoAnalysis]: Preferences: [2024-11-20 22:20:42,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-20 22:20:42,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-20 22:20:42,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-20 22:20:42,029 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-20 22:20:42,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-20 22:20:42,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-20 22:20:42,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2024-11-20 22:20:42,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-20 22:20:42,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-20 22:20:42,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-20 22:20:42,554 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-20 22:20:42,554 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-20 22:20:42,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-20 22:20:42,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:42,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:42,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:42,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:42,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:42,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:42,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:42,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:42,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:42,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:42,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,579 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-20 22:20:42,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:42,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:42,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:42,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:42,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:42,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:42,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:42,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:42,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:42,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-20 22:20:42,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,607 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-20 22:20:42,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:42,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:42,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:42,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:42,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:42,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:42,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:42,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:42,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:42,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-20 22:20:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,639 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-20 22:20:42,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:42,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:42,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:42,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:42,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:42,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:42,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:42,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:42,681 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:42,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:42,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,691 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-20 22:20:42,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:42,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:42,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-20 22:20:42,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:42,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:42,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:42,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-20 22:20:42,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-20 22:20:42,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-20 22:20:42,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:42,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,722 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-20 22:20:42,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-20 22:20:42,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-20 22:20:42,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-20 22:20:42,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-20 22:20:42,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-20 22:20:42,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-20 22:20:42,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-20 22:20:42,746 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-20 22:20:42,768 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-20 22:20:42,768 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-20 22:20:42,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-20 22:20:42,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 22:20:42,770 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-20 22:20:42,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-20 22:20:42,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-20 22:20:42,782 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-20 22:20:42,782 INFO L474 LassoAnalysis]: Proved termination. [2024-11-20 22:20:42,783 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrcat_~s~0#1.base)_1) = -1*ULTIMATE.start_cstrcat_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcat_~s~0#1.base)_1 Supporting invariants [] [2024-11-20 22:20:42,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-20 22:20:42,807 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-20 22:20:42,809 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-20 22:20:42,810 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-20 22:20:42,810 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-20 22:20:42,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 22:20:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:42,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 22:20:42,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 22:20:42,875 WARN L253 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 22:20:42,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 22:20:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 22:20:42,890 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-20 22:20:42,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:42,915 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 62 transitions. Complement of second has 6 states. [2024-11-20 22:20:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-20 22:20:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 22:20:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-20 22:20:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-20 22:20:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2024-11-20 22:20:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-20 22:20:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-20 22:20:42,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2024-11-20 22:20:42,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:20:42,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2024-11-20 22:20:42,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-20 22:20:42,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-20 22:20:42,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-20 22:20:42,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-20 22:20:42,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:20:42,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:20:42,923 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 22:20:42,923 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-20 22:20:42,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-20 22:20:42,923 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-20 22:20:42,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-20 22:20:42,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 10:20:42 BoogieIcfgContainer [2024-11-20 22:20:42,933 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-20 22:20:42,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 22:20:42,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 22:20:42,934 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 22:20:42,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:36" (3/4) ... [2024-11-20 22:20:42,936 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 22:20:42,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 22:20:42,938 INFO L158 Benchmark]: Toolchain (without parser) took 7856.47ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 112.7MB in the beginning and 203.3MB in the end (delta: -90.7MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-20 22:20:42,938 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:20:42,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.43ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 93.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 22:20:42,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.63ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:20:42,939 INFO L158 Benchmark]: Boogie Preprocessor took 50.27ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 89.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 22:20:42,940 INFO L158 Benchmark]: RCFGBuilder took 468.01ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 74.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 22:20:42,940 INFO L158 Benchmark]: BuchiAutomizer took 6790.06ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 74.9MB in the beginning and 204.4MB in the end (delta: -129.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:20:42,940 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 260.0MB. Free memory was 204.4MB in the beginning and 203.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 22:20:42,945 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.18ms. Allocated memory is still 167.8MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.43ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 93.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.63ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.27ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 89.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.01ms. Allocated memory is still 167.8MB. Free memory was 89.6MB in the beginning and 74.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6790.06ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 74.9MB in the beginning and 204.4MB in the end (delta: -129.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 260.0MB. Free memory was 204.4MB in the beginning and 203.3MB in the end (delta: 1.0MB). 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: ~s~0!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 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (length1 + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function (length2 + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 90 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax113 hnf100 lsp84 ukn76 mio100 lsp45 div167 bol100 ite100 ukn100 eq161 hnf92 smp78 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 146ms VariablesStem: 12 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-20 22:20:42,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-20 22:20:43,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-20 22:20:43,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE