./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../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-803cd42-m [2024-11-23 02:16:19,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:16:20,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:16:20,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:16:20,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:16:20,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:16:20,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:16:20,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:16:20,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:16:20,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:16:20,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:16:20,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:16:20,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:16:20,055 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:16:20,056 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:16:20,057 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:16:20,057 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:16:20,057 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:16:20,057 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:16:20,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:16:20,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:16:20,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:16:20,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:16:20,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:16:20,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:16:20,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:16:20,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:16:20,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:16:20,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:16:20,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:16:20,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:16:20,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:16:20,062 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:16:20,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:16:20,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:16:20,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:16:20,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:16:20,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:16:20,064 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:16:20,064 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-23 02:16:20,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:16:20,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:16:20,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:16:20,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:16:20,568 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:16:20,570 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-23 02:16:22,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:16:22,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:16:22,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2024-11-23 02:16:22,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eaded8d2/9ec3d16f6c10414b8968c7728bc4b807/FLAGb160118ca [2024-11-23 02:16:22,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eaded8d2/9ec3d16f6c10414b8968c7728bc4b807 [2024-11-23 02:16:22,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:16:22,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:16:22,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:16:22,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:16:22,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:16:22,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:22" (1/1) ... [2024-11-23 02:16:22,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a567b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:22, skipping insertion in model container [2024-11-23 02:16:22,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:22" (1/1) ... [2024-11-23 02:16:22,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:16:22,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:16:22,927 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:16:23,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:16:23,064 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:16:23,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23 WrapperNode [2024-11-23 02:16:23,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:16:23,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:16:23,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:16:23,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:16:23,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,100 INFO L138 Inliner]: procedures = 117, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2024-11-23 02:16:23,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:16:23,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:16:23,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:16:23,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:16:23,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,135 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-23 02:16:23,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:16:23,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:16:23,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:16:23,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:16:23,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (1/1) ... [2024-11-23 02:16:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:23,180 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-23 02:16:23,183 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-23 02:16:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:16:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:16:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:16:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:16:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:16:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:16:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:16:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:16:23,305 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:16:23,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:16:23,414 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-23 02:16:23,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:16:23,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:16:23,437 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-23 02:16:23,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:23 BoogieIcfgContainer [2024-11-23 02:16:23,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:16:23,438 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:16:23,438 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:16:23,444 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:16:23,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:16:23,447 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:16:22" (1/3) ... [2024-11-23 02:16:23,448 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f8b5ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:23, skipping insertion in model container [2024-11-23 02:16:23,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:16:23,448 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:23" (2/3) ... [2024-11-23 02:16:23,449 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f8b5ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:16:23, skipping insertion in model container [2024-11-23 02:16:23,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:16:23,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:23" (3/3) ... [2024-11-23 02:16:23,450 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2024-11-23 02:16:23,497 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:16:23,498 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:16:23,498 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:16:23,498 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:16:23,498 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:16:23,502 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:16:23,502 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:16:23,502 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:16:23,507 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-23 02:16:23,533 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-23 02:16:23,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:23,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:23,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:16:23,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:23,541 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:16:23,542 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-23 02:16:23,543 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-23 02:16:23,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:23,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:23,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-23 02:16:23,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:23,559 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-23 02:16:23,559 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-23 02:16:23,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2024-11-23 02:16:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145073849] [2024-11-23 02:16:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:23,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:23,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2024-11-23 02:16:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844019540] [2024-11-23 02:16:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:23,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:23,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:23,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2024-11-23 02:16:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326610630] [2024-11-23 02:16:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:23,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:23,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:24,233 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:24,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:24,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:24,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:24,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:24,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:24,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:24,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:24,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2024-11-23 02:16:24,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:24,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:24,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:24,856 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:24,860 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:24,868 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-23 02:16:24,870 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-23 02:16:24,872 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-23 02:16:24,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:24,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:24,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:24,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:24,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:24,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:24,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:24,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:24,899 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-23 02:16:24,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:24,902 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-23 02:16:24,905 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-23 02:16:24,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:16:24,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:24,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:24,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:24,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:24,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:24,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:24,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:24,996 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-23 02:16:24,996 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2024-11-23 02:16:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:25,023 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-23 02:16:25,031 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-23 02:16:25,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:25,054 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:16:25,055 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:25,055 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-23 02:16:25,066 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-23 02:16:25,089 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-23 02:16:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:25,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:16:25,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:25,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:16:25,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:25,168 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-23 02:16:25,201 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-23 02:16:25,203 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-23 02:16:25,238 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-23 02:16:25,240 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-23 02:16:25,244 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-23 02:16:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2024-11-23 02:16:25,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-23 02:16:25,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:25,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-23 02:16:25,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:25,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-23 02:16:25,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:25,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2024-11-23 02:16:25,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-23 02:16:25,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 17 states and 26 transitions. [2024-11-23 02:16:25,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-23 02:16:25,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-23 02:16:25,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2024-11-23 02:16:25,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:25,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-23 02:16:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2024-11-23 02:16:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-23 02:16:25,272 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-23 02:16:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2024-11-23 02:16:25,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-23 02:16:25,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2024-11-23 02:16:25,274 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:16:25,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2024-11-23 02:16:25,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-23 02:16:25,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:25,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:25,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:25,276 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:25,276 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-23 02:16:25,276 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-23 02:16:25,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2024-11-23 02:16:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411898784] [2024-11-23 02:16:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:25,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:25,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2024-11-23 02:16:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234748180] [2024-11-23 02:16:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:25,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:25,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:25,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:25,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2024-11-23 02:16:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559818567] [2024-11-23 02:16:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:25,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:25,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:25,594 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:25,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:25,595 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:25,595 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:25,595 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:25,595 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:25,595 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:25,595 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:25,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2024-11-23 02:16:25,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:25,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:25,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,667 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-23 02:16:25,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:25,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:26,006 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:26,006 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:26,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,009 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-23 02:16:26,010 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-23 02:16:26,011 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-23 02:16:26,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:26,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:26,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:26,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:26,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:26,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:26,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:26,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:26,034 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-23 02:16:26,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,038 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-23 02:16:26,039 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-23 02:16:26,040 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-23 02:16:26,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:26,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:26,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:26,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:26,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:26,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:26,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:26,070 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-23 02:16:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,073 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-23 02:16:26,075 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-23 02:16:26,106 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-23 02:16:26,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:26,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:26,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:26,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:26,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:26,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:26,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:26,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:26,157 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-23 02:16:26,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,163 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-23 02:16:26,166 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-23 02:16:26,167 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-23 02:16:26,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:26,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:26,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:26,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:26,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:26,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:26,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:26,195 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-23 02:16:26,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,199 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-23 02:16:26,201 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-23 02:16:26,205 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-23 02:16:26,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:26,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:26,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:26,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:26,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:26,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:26,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:26,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:26,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,233 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-23 02:16:26,235 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-23 02:16:26,237 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-23 02:16:26,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:26,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:26,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:26,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:26,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:26,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:26,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:26,290 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-23 02:16:26,290 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-23 02:16:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,292 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-23 02:16:26,293 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-23 02:16:26,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:26,305 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:16:26,305 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:26,306 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-23 02:16:26,312 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-23 02:16:26,325 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-23 02:16:26,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,384 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-23 02:16:26,385 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-23 02:16:26,385 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-23 02:16:26,398 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-23 02:16:26,399 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-23 02:16:26,400 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-23 02:16:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-23 02:16:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-23 02:16:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-23 02:16:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-23 02:16:26,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:26,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 38 transitions. [2024-11-23 02:16:26,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:16:26,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 27 transitions. [2024-11-23 02:16:26,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-23 02:16:26,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-23 02:16:26,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2024-11-23 02:16:26,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:26,402 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-23 02:16:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2024-11-23 02:16:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-23 02:16:26,404 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-23 02:16:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2024-11-23 02:16:26,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-23 02:16:26,404 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2024-11-23 02:16:26,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:16:26,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2024-11-23 02:16:26,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:16:26,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:26,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:26,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:26,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:26,406 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-23 02:16:26,406 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-23 02:16:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2024-11-23 02:16:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75743207] [2024-11-23 02:16:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,479 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-23 02:16:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:26,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75743207] [2024-11-23 02:16:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75743207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:16:26,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:16:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 02:16:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675608525] [2024-11-23 02:16:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:16:26,482 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-23 02:16:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2024-11-23 02:16:26,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491065165] [2024-11-23 02:16:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:26,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:26,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 02:16:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 02:16:26,537 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-23 02:16:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:26,555 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2024-11-23 02:16:26,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2024-11-23 02:16:26,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:16:26,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2024-11-23 02:16:26,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-23 02:16:26,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-23 02:16:26,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-11-23 02:16:26,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:26,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-23 02:16:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-11-23 02:16:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-23 02:16:26,558 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-23 02:16:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2024-11-23 02:16:26,558 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-23 02:16:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 02:16:26,562 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-23 02:16:26,562 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:16:26,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2024-11-23 02:16:26,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:16:26,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:26,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:26,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:26,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:26,564 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-23 02:16:26,564 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-23 02:16:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2024-11-23 02:16:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304546150] [2024-11-23 02:16:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:26,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:26,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2024-11-23 02:16:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:26,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478571781] [2024-11-23 02:16:26,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:26,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:16:26,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:26,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:26,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2024-11-23 02:16:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890235876] [2024-11-23 02:16:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-23 02:16:26,848 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-23 02:16:26,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:26,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890235876] [2024-11-23 02:16:26,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890235876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:16:26,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884739752] [2024-11-23 02:16:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:26,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:16:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:26,854 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-23 02:16:26,855 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-23 02:16:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:26,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 02:16:26,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:26,988 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-23 02:16:26,993 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-23 02:16:26,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:16:27,002 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-23 02:16:27,006 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-23 02:16:27,094 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-23 02:16:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884739752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:16:27,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:16:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-23 02:16:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789547054] [2024-11-23 02:16:27,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:16:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:27,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 02:16:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-23 02:16:27,131 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-23 02:16:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:27,354 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2024-11-23 02:16:27,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2024-11-23 02:16:27,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:16:27,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 48 transitions. [2024-11-23 02:16:27,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-23 02:16:27,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-23 02:16:27,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2024-11-23 02:16:27,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:27,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-23 02:16:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2024-11-23 02:16:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-23 02:16:27,359 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-23 02:16:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-11-23 02:16:27,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-23 02:16:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 02:16:27,362 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-23 02:16:27,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:16:27,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2024-11-23 02:16:27,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-23 02:16:27,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:27,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:27,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:27,364 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:27,364 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-23 02:16:27,365 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-23 02:16:27,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1505990522, now seen corresponding path program 1 times [2024-11-23 02:16:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097672245] [2024-11-23 02:16:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:27,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:27,398 INFO L85 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2024-11-23 02:16:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:27,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429297869] [2024-11-23 02:16:27,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:27,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 147089355, now seen corresponding path program 1 times [2024-11-23 02:16:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240181356] [2024-11-23 02:16:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:16:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:27,544 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-23 02:16:27,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:16:27,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240181356] [2024-11-23 02:16:27,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240181356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:16:27,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:16:27,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:16:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502443086] [2024-11-23 02:16:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:16:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:16:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 02:16:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 02:16:27,637 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-23 02:16:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:16:27,663 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-11-23 02:16:27,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2024-11-23 02:16:27,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-23 02:16:27,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 53 transitions. [2024-11-23 02:16:27,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-23 02:16:27,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-23 02:16:27,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-23 02:16:27,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:27,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-23 02:16:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-23 02:16:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-23 02:16:27,666 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-23 02:16:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-23 02:16:27,667 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-23 02:16:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 02:16:27,668 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-23 02:16:27,668 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:16:27,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2024-11-23 02:16:27,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-23 02:16:27,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:16:27,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:16:27,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:16:27,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-23 02:16:27,669 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-23 02:16:27,669 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-23 02:16:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2024-11-23 02:16:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950343509] [2024-11-23 02:16:27,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:27,682 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:27,682 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:27,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:27,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2024-11-23 02:16:27,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803916011] [2024-11-23 02:16:27,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:16:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:27,692 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:16:27,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:27,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2024-11-23 02:16:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:16:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849632593] [2024-11-23 02:16:27,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:16:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:16:27,707 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:16:27,707 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:16:27,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:16:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:16:27,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:16:28,292 INFO L204 LassoAnalysis]: Preferences: [2024-11-23 02:16:28,293 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-23 02:16:28,293 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-23 02:16:28,293 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-23 02:16:28,293 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-23 02:16:28,293 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,293 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-23 02:16:28,293 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-23 02:16:28,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2024-11-23 02:16:28,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-23 02:16:28,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-23 02:16:28,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-23 02:16:28,738 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-23 02:16:28,738 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-23 02:16:28,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,740 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-23 02:16:28,743 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-23 02:16:28,744 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-23 02:16:28,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:28,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:28,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:28,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:28,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:28,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:28,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:28,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:28,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-23 02:16:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,765 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-23 02:16:28,771 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-23 02:16:28,774 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-23 02:16:28,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:28,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:28,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:28,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:28,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:28,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:28,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:28,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:28,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-23 02:16:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,792 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-23 02:16:28,793 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-23 02:16:28,794 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-23 02:16:28,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:28,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:28,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:28,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:28,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:28,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:28,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:28,806 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:28,812 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-23 02:16:28,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,814 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-23 02:16:28,815 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-23 02:16:28,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:16:28,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:28,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:28,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:28,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:28,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:28,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:28,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:28,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:28,834 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-23 02:16:28,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,835 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-23 02:16:28,836 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-23 02:16:28,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-23 02:16:28,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:28,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-23 02:16:28,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:28,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:28,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:28,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-23 02:16:28,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-23 02:16:28,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-23 02:16:28,859 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-23 02:16:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,861 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-23 02:16:28,861 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-23 02:16:28,863 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-23 02:16:28,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-23 02:16:28,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-23 02:16:28,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-23 02:16:28,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-23 02:16:28,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-23 02:16:28,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-23 02:16:28,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-23 02:16:28,899 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-23 02:16:28,899 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-23 02:16:28,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:16:28,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:16:28,901 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-23 02:16:28,903 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-23 02:16:28,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-23 02:16:28,914 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-23 02:16:28,914 INFO L474 LassoAnalysis]: Proved termination. [2024-11-23 02:16:28,914 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-23 02:16:28,921 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-23 02:16:28,932 INFO L156 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2024-11-23 02:16:28,933 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-23 02:16:28,934 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-23 02:16:28,934 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-23 02:16:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:16:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:28,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 02:16:28,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:16:28,989 WARN L253 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 02:16:28,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:16:28,998 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-23 02:16:28,998 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-23 02:16:28,998 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-23 02:16:29,014 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-23 02:16:29,015 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-23 02:16:29,015 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-23 02:16:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-23 02:16:29,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 2 letters. [2024-11-23 02:16:29,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:29,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 16 letters. Loop has 2 letters. [2024-11-23 02:16:29,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:29,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 4 letters. [2024-11-23 02:16:29,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-23 02:16:29,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2024-11-23 02:16:29,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:16:29,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2024-11-23 02:16:29,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-23 02:16:29,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-23 02:16:29,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-23 02:16:29,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:16:29,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:16:29,017 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:16:29,017 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 02:16:29,017 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:16:29,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-23 02:16:29,017 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-23 02:16:29,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-23 02:16:29,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:16:29 BoogieIcfgContainer [2024-11-23 02:16:29,023 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-23 02:16:29,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 02:16:29,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 02:16:29,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 02:16:29,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:23" (3/4) ... [2024-11-23 02:16:29,025 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 02:16:29,026 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 02:16:29,026 INFO L158 Benchmark]: Toolchain (without parser) took 6426.33ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 105.8MB in the beginning and 164.4MB in the end (delta: -58.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-23 02:16:29,027 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:16:29,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.53ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 141.3MB in the end (delta: -35.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-23 02:16:29,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 176.2MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:16:29,027 INFO L158 Benchmark]: Boogie Preprocessor took 43.76ms. Allocated memory is still 176.2MB. Free memory was 139.2MB in the beginning and 137.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 02:16:29,027 INFO L158 Benchmark]: RCFGBuilder took 288.31ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 122.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-23 02:16:29,028 INFO L158 Benchmark]: BuchiAutomizer took 5585.28ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 121.2MB in the beginning and 164.4MB in the end (delta: -43.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-23 02:16:29,028 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 237.0MB. Free memory is still 164.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 02:16:29,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.53ms. Allocated memory is still 176.2MB. Free memory was 105.6MB in the beginning and 141.3MB in the end (delta: -35.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 176.2MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.76ms. Allocated memory is still 176.2MB. Free memory was 139.2MB in the beginning and 137.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 288.31ms. Allocated memory is still 176.2MB. Free memory was 137.1MB in the beginning and 122.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 5585.28ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 121.2MB in the beginning and 164.4MB in the end (delta: -43.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 237.0MB. Free memory is still 164.4MB. 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 5.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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.1s 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: 154ms 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-23 02:16:29,040 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-23 02:16:29,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-23 02:16:29,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE