./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:25:10,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:25:10,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:25:10,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:25:10,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:25:10,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:25:10,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:25:10,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:25:10,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:25:10,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:25:10,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:25:10,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:25:10,493 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:25:10,494 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:25:10,496 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:25:10,496 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:25:10,497 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:25:10,497 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:25:10,497 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:25:10,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:25:10,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:25:10,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:25:10,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:25:10,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:25:10,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:25:10,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:25:10,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:25:10,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:25:10,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:25:10,500 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:25:10,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:25:10,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:25:10,501 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:25:10,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:25:10,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:25:10,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:25:10,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:25:10,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:25:10,504 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:25:10,504 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-19 14:25:10,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:25:10,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:25:10,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:25:10,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:25:10,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:25:10,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2024-11-19 14:25:12,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:25:12,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:25:12,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2024-11-19 14:25:12,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d77ccbfc/23f50b4e744e4dac8222a4cc98693319/FLAG2653d8348 [2024-11-19 14:25:12,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d77ccbfc/23f50b4e744e4dac8222a4cc98693319 [2024-11-19 14:25:12,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:25:12,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:25:12,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:25:12,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:25:12,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:25:12,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:25:12" (1/1) ... [2024-11-19 14:25:12,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b939cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:12, skipping insertion in model container [2024-11-19 14:25:12,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:25:12" (1/1) ... [2024-11-19 14:25:12,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:25:13,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:25:13,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:25:13,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:25:13,268 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:25:13,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13 WrapperNode [2024-11-19 14:25:13,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:25:13,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:25:13,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:25:13,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:25:13,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,315 INFO L138 Inliner]: procedures = 117, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2024-11-19 14:25:13,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:25:13,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:25:13,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:25:13,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:25:13,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,351 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-19 14:25:13,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:25:13,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:25:13,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:25:13,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:25:13,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (1/1) ... [2024-11-19 14:25:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:13,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:13,404 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-19 14:25:13,411 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-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:25:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:25:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:25:13,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:25:13,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:25:13,788 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 14:25:13,789 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:25:13,799 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:25:13,799 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 14:25:13,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:25:13 BoogieIcfgContainer [2024-11-19 14:25:13,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:25:13,802 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:25:13,803 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:25:13,807 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:25:13,807 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:25:13,808 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:25:12" (1/3) ... [2024-11-19 14:25:13,808 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69a76b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:25:13, skipping insertion in model container [2024-11-19 14:25:13,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:25:13,809 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:13" (2/3) ... [2024-11-19 14:25:13,810 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69a76b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:25:13, skipping insertion in model container [2024-11-19 14:25:13,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:25:13,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:25:13" (3/3) ... [2024-11-19 14:25:13,812 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2024-11-19 14:25:13,855 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:25:13,855 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:25:13,856 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:25:13,856 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:25:13,856 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:25:13,856 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:25:13,856 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:25:13,856 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:25:13,860 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-19 14:25:13,874 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-19 14:25:13,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:13,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:13,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:25:13,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:13,879 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:25:13,879 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-19 14:25:13,881 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-19 14:25:13,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:13,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:13,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:25:13,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:13,887 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-19 14:25:13,887 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-19 14:25:13,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2024-11-19 14:25:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750662168] [2024-11-19 14:25:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:14,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:14,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:14,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2024-11-19 14:25:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:14,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539037760] [2024-11-19 14:25:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:14,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:14,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:14,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2024-11-19 14:25:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371285941] [2024-11-19 14:25:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:14,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:14,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:14,594 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:14,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:14,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:14,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:14,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:14,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:14,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:14,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:14,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2024-11-19 14:25:14,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:14,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:14,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:14,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:15,361 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:15,365 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:15,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:15,370 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-19 14:25:15,372 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-19 14:25:15,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:15,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:15,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:15,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:15,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:15,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:15,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:15,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:15,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:15,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:25:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:15,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:15,412 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-19 14:25:15,414 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-19 14:25:15,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:15,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:15,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:15,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:15,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:15,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:15,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:15,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:15,517 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:25:15,517 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2024-11-19 14:25:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:15,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:15,536 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-19 14:25:15,538 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-19 14:25:15,539 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:15,557 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:25:15,558 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:15,558 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-19 14:25:15,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:15,595 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:25:15,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:15,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:15,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:15,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:25:15,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:15,700 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-19 14:25:15,735 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-19 14:25:15,737 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-19 14:25:15,786 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-19 14:25:15,788 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-19 14:25:15,792 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-19 14:25:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2024-11-19 14:25:15,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:25:15,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:15,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-19 14:25:15,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:15,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-19 14:25:15,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:15,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2024-11-19 14:25:15,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-19 14:25:15,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 26 transitions. [2024-11-19 14:25:15,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:25:15,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-19 14:25:15,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2024-11-19 14:25:15,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:15,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-19 14:25:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2024-11-19 14:25:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-19 14:25:15,826 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-19 14:25:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2024-11-19 14:25:15,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-19 14:25:15,829 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-19 14:25:15,829 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:25:15,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2024-11-19 14:25:15,830 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-19 14:25:15,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:15,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:15,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:15,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:15,831 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-19 14:25:15,832 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-19 14:25:15,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:15,834 INFO L85 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2024-11-19 14:25:15,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274316038] [2024-11-19 14:25:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:15,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:15,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:15,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:15,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:15,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2024-11-19 14:25:15,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:15,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935720708] [2024-11-19 14:25:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:15,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:15,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2024-11-19 14:25:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:15,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106751601] [2024-11-19 14:25:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:15,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:15,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:16,228 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:16,229 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:16,229 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:16,229 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:16,229 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:16,229 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,229 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:16,229 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:16,230 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2024-11-19 14:25:16,230 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:16,230 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:16,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:16,715 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:16,716 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:16,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,718 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-19 14:25:16,720 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-19 14:25:16,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:16,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:16,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:16,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:16,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:16,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:16,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:16,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:16,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:16,764 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-19 14:25:16,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 14:25:16,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,767 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-19 14:25:16,768 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-19 14:25:16,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:16,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:16,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:16,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:16,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:16,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:16,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:16,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:16,805 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-19 14:25:16,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,808 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-19 14:25:16,809 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-19 14:25:16,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:16,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:16,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:16,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:16,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:16,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:16,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:16,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:16,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:16,843 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-19 14:25:16,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,845 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-19 14:25:16,846 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-19 14:25:16,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:16,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:16,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:16,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:16,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:16,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:16,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:16,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:16,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:16,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,884 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-19 14:25:16,885 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-19 14:25:16,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:16,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:16,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:16,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:16,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:16,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:16,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:16,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:16,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:25:16,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,921 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-19 14:25:16,922 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-19 14:25:16,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:16,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:16,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:16,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:16,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:16,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:16,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:16,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:16,982 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-19 14:25:16,982 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-19 14:25:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:16,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:16,984 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-19 14:25:16,987 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-19 14:25:16,987 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:17,003 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:25:17,004 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:17,004 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-19 14:25:17,015 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-19 14:25:17,032 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 14:25:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:17,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:17,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:17,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:25:17,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:17,100 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-19 14:25:17,101 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-19 14:25:17,102 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-19 14:25:17,125 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-19 14:25:17,127 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-19 14:25:17,128 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-19 14:25:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-19 14:25:17,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-19 14:25:17,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:17,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:25:17,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:17,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-19 14:25:17,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:17,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 38 transitions. [2024-11-19 14:25:17,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:25:17,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 27 transitions. [2024-11-19 14:25:17,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-19 14:25:17,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:25:17,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2024-11-19 14:25:17,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:17,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-19 14:25:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2024-11-19 14:25:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-19 14:25:17,133 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-19 14:25:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2024-11-19 14:25:17,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-19 14:25:17,134 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-19 14:25:17,134 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:25:17,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2024-11-19 14:25:17,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:25:17,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:17,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:17,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:17,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:17,135 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-19 14:25:17,135 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-19 14:25:17,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2024-11-19 14:25:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289226795] [2024-11-19 14:25:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:17,282 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-19 14:25:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289226795] [2024-11-19 14:25:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289226795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:25:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:25:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:25:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465649869] [2024-11-19 14:25:17,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:25:17,286 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:25:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2024-11-19 14:25:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:17,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680534485] [2024-11-19 14:25:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:17,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:17,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:25:17,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:25:17,351 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-19 14:25:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:17,374 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2024-11-19 14:25:17,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2024-11-19 14:25:17,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:25:17,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2024-11-19 14:25:17,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-19 14:25:17,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-19 14:25:17,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-11-19 14:25:17,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:17,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-19 14:25:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-11-19 14:25:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-19 14:25:17,377 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-19 14:25:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2024-11-19 14:25:17,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-19 14:25:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:25:17,379 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-19 14:25:17,379 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:25:17,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2024-11-19 14:25:17,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:25:17,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:17,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:17,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:17,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:17,381 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-19 14:25:17,381 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-19 14:25:17,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2024-11-19 14:25:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786569367] [2024-11-19 14:25:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:17,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:17,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2024-11-19 14:25:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108259041] [2024-11-19 14:25:17,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:17,429 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:25:17,429 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:17,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:17,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2024-11-19 14:25:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:17,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042431250] [2024-11-19 14:25:17,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:17,762 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-19 14:25:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042431250] [2024-11-19 14:25:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042431250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816161176] [2024-11-19 14:25:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:17,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:17,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:17,765 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-19 14:25:17,766 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-19 14:25:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:17,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 14:25:17,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:17,946 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-19 14:25:17,954 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-19 14:25:17,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:17,966 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-19 14:25:17,970 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-19 14:25:18,018 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-19 14:25:18,115 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-19 14:25:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816161176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:18,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:18,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-19 14:25:18,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544595624] [2024-11-19 14:25:18,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:25:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:25:18,160 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-19 14:25:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:18,426 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-19 14:25:18,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2024-11-19 14:25:18,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:25:18,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 48 transitions. [2024-11-19 14:25:18,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:25:18,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:25:18,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2024-11-19 14:25:18,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:18,429 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-19 14:25:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2024-11-19 14:25:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-19 14:25:18,431 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-19 14:25:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-11-19 14:25:18,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-19 14:25:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 14:25:18,432 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-19 14:25:18,432 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:25:18,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2024-11-19 14:25:18,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-19 14:25:18,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:18,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:18,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:18,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:18,434 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-19 14:25:18,434 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-19 14:25:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1505990522, now seen corresponding path program 1 times [2024-11-19 14:25:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758837657] [2024-11-19 14:25:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2024-11-19 14:25:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237514575] [2024-11-19 14:25:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 147089355, now seen corresponding path program 1 times [2024-11-19 14:25:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816335280] [2024-11-19 14:25:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:18,678 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-19 14:25:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816335280] [2024-11-19 14:25:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816335280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:25:18,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:25:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 14:25:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882669103] [2024-11-19 14:25:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:25:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 14:25:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 14:25:18,772 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-19 14:25:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:18,806 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-11-19 14:25:18,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2024-11-19 14:25:18,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-19 14:25:18,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 53 transitions. [2024-11-19 14:25:18,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 14:25:18,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:25:18,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-19 14:25:18,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:18,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-19 14:25:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-19 14:25:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-19 14:25:18,815 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-19 14:25:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-19 14:25:18,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-19 14:25:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:25:18,817 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-19 14:25:18,817 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:25:18,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2024-11-19 14:25:18,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-19 14:25:18,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:18,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:18,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:18,818 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:18,818 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-19 14:25:18,818 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-19 14:25:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2024-11-19 14:25:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815072863] [2024-11-19 14:25:18,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:18,845 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:18,846 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:18,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:18,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:18,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2024-11-19 14:25:18,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:18,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878829435] [2024-11-19 14:25:18,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:25:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:18,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:25:18,873 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:18,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:18,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2024-11-19 14:25:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469078722] [2024-11-19 14:25:18,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:18,904 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:18,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:18,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:18,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:19,597 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:19,597 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:19,597 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:19,597 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:19,597 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:19,597 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:19,597 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:19,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:19,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2024-11-19 14:25:19,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:19,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:19,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:19,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:20,148 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:20,149 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,151 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-19 14:25:20,152 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-19 14:25:20,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:20,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:20,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:20,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:20,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:20,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:20,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:20,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:20,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:20,175 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-19 14:25:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,176 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-19 14:25:20,177 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-19 14:25:20,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:20,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:20,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:20,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:20,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:20,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:20,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:20,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:20,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:20,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:20,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,206 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-19 14:25:20,207 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-19 14:25:20,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:20,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:20,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:20,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:20,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:20,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:20,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:20,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:20,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:20,231 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-19 14:25:20,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,232 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-19 14:25:20,234 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-19 14:25:20,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:20,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:20,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:20,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:20,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:20,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:20,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:20,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:20,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:20,256 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-19 14:25:20,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,257 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-19 14:25:20,258 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-19 14:25:20,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:20,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:20,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:20,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:20,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:20,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:20,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:20,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:20,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:20,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:25:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,283 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-19 14:25:20,284 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-19 14:25:20,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 14:25:20,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:20,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:20,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:20,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:20,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:20,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:20,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:20,332 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-19 14:25:20,332 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-19 14:25:20,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:20,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:20,335 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-19 14:25:20,337 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-19 14:25:20,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:20,352 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:25:20,352 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:20,352 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-19 14:25:20,367 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-19 14:25:20,383 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-19 14:25:20,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-19 14:25:20,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:25:20,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:25:20,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:20,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:20,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:20,448 WARN L253 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:25:20,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:20,463 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-19 14:25:20,463 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-19 14:25:20,464 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-19 14:25:20,485 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-19 14:25:20,486 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-19 14:25:20,487 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-19 14:25:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-19 14:25:20,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-19 14:25:20,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:20,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2024-11-19 14:25:20,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:20,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-19 14:25:20,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:20,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2024-11-19 14:25:20,489 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:25:20,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2024-11-19 14:25:20,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-19 14:25:20,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-19 14:25:20,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-19 14:25:20,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:20,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:25:20,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:25:20,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 14:25:20,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:25:20,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-19 14:25:20,492 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-19 14:25:20,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-19 14:25:20,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 02:25:20 BoogieIcfgContainer [2024-11-19 14:25:20,500 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 14:25:20,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 14:25:20,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 14:25:20,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 14:25:20,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:25:13" (3/4) ... [2024-11-19 14:25:20,504 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 14:25:20,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 14:25:20,506 INFO L158 Benchmark]: Toolchain (without parser) took 7705.78ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 100.3MB in the beginning and 182.7MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:25:20,506 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 172.0MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:25:20,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.11ms. Allocated memory is still 172.0MB. Free memory was 100.1MB in the beginning and 81.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 14:25:20,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.81ms. Allocated memory is still 172.0MB. Free memory was 81.2MB in the beginning and 79.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:25:20,511 INFO L158 Benchmark]: Boogie Preprocessor took 51.03ms. Allocated memory is still 172.0MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 14:25:20,511 INFO L158 Benchmark]: RCFGBuilder took 432.06ms. Allocated memory is still 172.0MB. Free memory was 77.0MB in the beginning and 132.5MB in the end (delta: -55.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-19 14:25:20,511 INFO L158 Benchmark]: BuchiAutomizer took 6698.36ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 132.5MB in the beginning and 183.8MB in the end (delta: -51.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-19 14:25:20,511 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 249.6MB. Free memory was 183.8MB in the beginning and 182.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 14:25:20,513 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.22ms. Allocated memory is still 172.0MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.11ms. Allocated memory is still 172.0MB. Free memory was 100.1MB in the beginning and 81.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.81ms. Allocated memory is still 172.0MB. Free memory was 81.2MB in the beginning and 79.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.03ms. Allocated memory is still 172.0MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.06ms. Allocated memory is still 172.0MB. Free memory was 77.0MB in the beginning and 132.5MB in the end (delta: -55.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 6698.36ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 132.5MB in the beginning and 183.8MB in the end (delta: -51.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 249.6MB. Free memory was 183.8MB in the beginning and 182.7MB 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.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: 148ms 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-19 14:25:20,535 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-19 14:25:20,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:20,937 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