./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncat_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrncat_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 5a61fb3bdd8c8080e4dbcf48deea241cadeed4c02fef8952e5b51d0e829dea4f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:28:00,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:28:00,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:28:00,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:28:00,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:28:00,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:28:00,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:28:00,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:28:00,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:28:00,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:28:00,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:28:00,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:28:00,216 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:28:00,216 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:28:00,216 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:28:00,216 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:28:00,217 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:28:00,217 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:28:00,217 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:28:00,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:28:00,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:28:00,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:28:00,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:28:00,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:28:00,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:28:00,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:28:00,222 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:28:00,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:28:00,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:28:00,222 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:28:00,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:28:00,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:28:00,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:28:00,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:28:00,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:28:00,224 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:28:00,224 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a61fb3bdd8c8080e4dbcf48deea241cadeed4c02fef8952e5b51d0e829dea4f [2024-11-09 15:28:00,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:28:00,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:28:00,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:28:00,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:28:00,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:28:00,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncat_malloc.i [2024-11-09 15:28:01,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:28:02,127 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:28:02,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncat_malloc.i [2024-11-09 15:28:02,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687e33d06/57d460e4189e46b3bc32330b7da2a03c/FLAG5f5a2a369 [2024-11-09 15:28:02,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687e33d06/57d460e4189e46b3bc32330b7da2a03c [2024-11-09 15:28:02,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:28:02,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:28:02,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:02,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:28:02,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:28:02,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:02,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773ff0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02, skipping insertion in model container [2024-11-09 15:28:02,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:02,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:28:02,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:02,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:28:02,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:02,990 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:28:02,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02 WrapperNode [2024-11-09 15:28:02,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:02,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:02,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:28:02,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:28:02,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,033 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-11-09 15:28:03,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:03,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:28:03,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:28:03,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:28:03,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,059 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2024-11-09 15:28:03,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:28:03,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:28:03,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:28:03,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:28:03,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (1/1) ... [2024-11-09 15:28:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:03,130 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-09 15:28:03,133 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-09 15:28:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:28:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:28:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:28:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:28:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:28:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:28:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:28:03,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:28:03,249 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:28:03,251 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:28:03,407 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-09 15:28:03,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:28:03,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:28:03,424 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:28:03,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:03 BoogieIcfgContainer [2024-11-09 15:28:03,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:28:03,425 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:28:03,426 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:28:03,430 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:28:03,432 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:03,432 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:28:02" (1/3) ... [2024-11-09 15:28:03,433 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6934f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:03, skipping insertion in model container [2024-11-09 15:28:03,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:03,433 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:02" (2/3) ... [2024-11-09 15:28:03,434 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6934f118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:03, skipping insertion in model container [2024-11-09 15:28:03,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:03,434 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:03" (3/3) ... [2024-11-09 15:28:03,436 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrncat_malloc.i [2024-11-09 15:28:03,488 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:28:03,488 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:28:03,488 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:28:03,488 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:28:03,488 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:28:03,489 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:28:03,489 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:28:03,489 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:28:03,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) 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-09 15:28:03,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:28:03,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:03,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:03,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:03,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:03,510 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:28:03,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) 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-09 15:28:03,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-09 15:28:03,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:03,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:03,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:03,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:03,519 INFO L745 eck$LassoCheckResult]: Stem: 13#$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~nondet213#1, main_#t~nondet214#1, main_#t~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~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~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;havoc main_#t~nondet215#1;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1; 17#L381true assume !(main_~length1~0#1 < 1); 14#L381-2true assume !(main_~length2~0#1 < 1); 12#L384-1true assume !(main_~n~0#1 < 1); 16#L387-1true assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;havoc main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~mem205#1, cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 2#L367-3true [2024-11-09 15:28:03,519 INFO L747 eck$LassoCheckResult]: Loop: 2#L367-3true call cstrncat_#t~mem205#1 := read~int#1(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 15#L367-1true assume !!(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1;cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post206#1.base, 1 + cstrncat_#t~post206#1.offset; 2#L367-3true [2024-11-09 15:28:03,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2024-11-09 15:28:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036109745] [2024-11-09 15:28:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:03,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:03,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2024-11-09 15:28:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604265008] [2024-11-09 15:28:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:03,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:03,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:03,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2024-11-09 15:28:03,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:03,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948180600] [2024-11-09 15:28:03,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:03,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:03,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:04,820 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:04,820 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:04,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:04,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:04,821 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:04,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:04,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:04,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:04,822 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrncat_malloc.i_Iteration1_Lasso [2024-11-09 15:28:04,822 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:04,822 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:04,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:04,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:04,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:05,619 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:05,623 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:05,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:05,627 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-09 15:28:05,629 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-09 15:28:05,630 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-09 15:28:05,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:05,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:05,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:05,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:05,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:05,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:05,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:05,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:05,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:05,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:05,665 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-09 15:28:05,668 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-09 15:28:05,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:05,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:05,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:05,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:05,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:05,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:05,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:05,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:05,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:05,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:28:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:05,700 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-09 15:28:05,701 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-09 15:28:05,702 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-09 15:28:05,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:05,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:05,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:05,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:05,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:05,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:05,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:05,739 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-09 15:28:05,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:05,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:05,742 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-09 15:28:05,744 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-09 15:28:05,745 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-09 15:28:05,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:05,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:05,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:05,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:05,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:05,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:05,778 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:05,804 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:28:05,804 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-09 15:28:05,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:05,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:05,815 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-09 15:28:05,820 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-09 15:28:05,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:05,834 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:05,835 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:05,835 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrncat_~s~0#1.base)_1) = -1*ULTIMATE.start_cstrncat_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0#1.base)_1 Supporting invariants [] [2024-11-09 15:28:05,851 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-09 15:28:05,869 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 15:28:05,876 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:05,877 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:05,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-09 15:28:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:05,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:28:05,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:05,949 WARN L253 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:28:05,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:05,966 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-09 15:28:05,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-09 15:28:06,000 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.588235294117647) 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) 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-09 15:28:06,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.588235294117647) 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). 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 52 states and 74 transitions. Complement of second has 8 states. [2024-11-09 15:28:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:06,077 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-09 15:28:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-11-09 15:28:06,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-09 15:28:06,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:06,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-09 15:28:06,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:06,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-09 15:28:06,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:06,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. [2024-11-09 15:28:06,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:06,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 20 states and 27 transitions. [2024-11-09 15:28:06,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-09 15:28:06,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-09 15:28:06,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2024-11-09 15:28:06,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:06,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-09 15:28:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2024-11-09 15:28:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-09 15:28:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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-09 15:28:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2024-11-09 15:28:06,114 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-09 15:28:06,114 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-11-09 15:28:06,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:28:06,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2024-11-09 15:28:06,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-09 15:28:06,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:06,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:06,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:06,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:06,119 INFO L745 eck$LassoCheckResult]: Stem: 158#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~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~nondet213#1;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;havoc main_#t~nondet214#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1;havoc main_#t~nondet215#1;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1; 161#L381 assume !(main_~length1~0#1 < 1); 160#L381-2 assume !(main_~length2~0#1 < 1); 156#L384-1 assume !(main_~n~0#1 < 1); 157#L387-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;havoc main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~mem205#1, cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 149#L367-3 call cstrncat_#t~mem205#1 := read~int#1(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 150#L367-1 assume !(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1; 147#L369-4 cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; 148#L369 assume !cstrncat_#t~short209#1; 155#L369-2 assume !!cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset; 162#L369-4 cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; 146#L369 [2024-11-09 15:28:06,119 INFO L747 eck$LassoCheckResult]: Loop: 146#L369 assume !cstrncat_#t~short209#1; 152#L369-2 assume !!cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset; 145#L369-4 cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; 146#L369 [2024-11-09 15:28:06,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2024-11-09 15:28:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902547105] [2024-11-09 15:28:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:06,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:06,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902547105] [2024-11-09 15:28:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902547105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:06,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971791622] [2024-11-09 15:28:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:06,203 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2024-11-09 15:28:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:06,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757882317] [2024-11-09 15:28:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:06,215 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-09 15:28:06,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757882317] [2024-11-09 15:28:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757882317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:06,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:28:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257669620] [2024-11-09 15:28:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:06,216 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:06,224 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:28:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:06,234 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2024-11-09 15:28:06,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2024-11-09 15:28:06,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:06,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2024-11-09 15:28:06,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:28:06,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:28:06,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:28:06,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:06,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:06,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:06,237 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:28:06,237 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:28:06,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:28:06,237 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:28:06,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:28:06,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:28:06 BoogieIcfgContainer [2024-11-09 15:28:06,245 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:28:06,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:28:06,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:28:06,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:28:06,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:03" (3/4) ... [2024-11-09 15:28:06,251 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:28:06,253 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:28:06,254 INFO L158 Benchmark]: Toolchain (without parser) took 3776.19ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 57.1MB in the beginning and 95.2MB in the end (delta: -38.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-09 15:28:06,255 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 127.9MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:06,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.93ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 56.9MB in the beginning and 135.1MB in the end (delta: -78.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-09 15:28:06,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.38ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:28:06,257 INFO L158 Benchmark]: Boogie Preprocessor took 53.51ms. Allocated memory is still 172.0MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:28:06,258 INFO L158 Benchmark]: RCFGBuilder took 336.66ms. Allocated memory is still 172.0MB. Free memory was 130.9MB in the beginning and 117.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:28:06,258 INFO L158 Benchmark]: BuchiAutomizer took 2819.64ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 95.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 15:28:06,259 INFO L158 Benchmark]: Witness Printer took 7.96ms. Allocated memory is still 172.0MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:28:06,261 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.42ms. Allocated memory is still 127.9MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.93ms. Allocated memory was 127.9MB in the beginning and 172.0MB in the end (delta: 44.0MB). Free memory was 56.9MB in the beginning and 135.1MB in the end (delta: -78.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.38ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.51ms. Allocated memory is still 172.0MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 336.66ms. Allocated memory is still 172.0MB. Free memory was 130.9MB in the beginning and 117.3MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2819.64ms. Allocated memory is still 172.0MB. Free memory was 116.2MB in the beginning and 95.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 7.96ms. Allocated memory is still 172.0MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 35 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax100 hnf100 lsp96 ukn65 mio100 lsp49 div100 bol100 ite100 ukn100 eq134 hnf94 smp100 dnf207 smp82 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 3 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-09 15:28:06,294 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-09 15:28:06,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE