./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_diffterm_alloca.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.graphml --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 0e48acfd964328d443bb00db1a9e4c58c0207581 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:39:32,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:32,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:32,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:32,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:32,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:32,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:32,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:32,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:32,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:32,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:32,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:32,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:32,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:32,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:32,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:32,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:32,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:32,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:32,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:32,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:32,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:32,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:32,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:32,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:32,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:32,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:32,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:32,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:32,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:32,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:32,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:32,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:32,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:32,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:32,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:32,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:32,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:32,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:32,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:32,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:32,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:39:32,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:32,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:32,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:32,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:32,662 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:32,663 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:32,663 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:32,663 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:32,663 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:32,663 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:32,664 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:32,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:32,664 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:32,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:32,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:32,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:32,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:32,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:32,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:32,666 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:32,666 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:32,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:32,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:32,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:32,667 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:32,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:32,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:32,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:32,668 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:32,669 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:32,669 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0e48acfd964328d443bb00db1a9e4c58c0207581 [2020-07-29 01:39:32,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:33,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:33,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:33,023 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:33,025 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:33,026 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i [2020-07-29 01:39:33,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba43a8df1/997a35305ed346ef84b3d0c4d71100b9/FLAGdb16759d6 [2020-07-29 01:39:33,613 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:33,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncat_diffterm_alloca.i [2020-07-29 01:39:33,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba43a8df1/997a35305ed346ef84b3d0c4d71100b9/FLAGdb16759d6 [2020-07-29 01:39:33,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba43a8df1/997a35305ed346ef84b3d0c4d71100b9 [2020-07-29 01:39:33,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:33,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:33,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:33,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:33,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:33,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:33" (1/1) ... [2020-07-29 01:39:33,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd89e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:33, skipping insertion in model container [2020-07-29 01:39:33,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:33" (1/1) ... [2020-07-29 01:39:33,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:33,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:34,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:34,480 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:34,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:34,664 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:34,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34 WrapperNode [2020-07-29 01:39:34,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:34,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:34,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:34,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:34,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:34,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:34,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:34,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:34,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... [2020-07-29 01:39:34,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:34,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:34,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:34,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:34,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:35,315 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:35,316 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:35,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:35 BoogieIcfgContainer [2020-07-29 01:39:35,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:35,321 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:35,321 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:35,324 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:35,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:35,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:33" (1/3) ... [2020-07-29 01:39:35,327 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f1300ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:35, skipping insertion in model container [2020-07-29 01:39:35,327 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:35,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:34" (2/3) ... [2020-07-29 01:39:35,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f1300ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:35, skipping insertion in model container [2020-07-29 01:39:35,328 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:35,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:35" (3/3) ... [2020-07-29 01:39:35,330 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat_diffterm_alloca.i [2020-07-29 01:39:35,390 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:35,391 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:35,392 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:35,392 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:35,392 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:35,392 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:35,393 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:35,393 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:35,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:35,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:39:35,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:35,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:35,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:35,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:35,461 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:35,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:35,471 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:39:35,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:35,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:35,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:35,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:35,482 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 5#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2020-07-29 01:39:35,483 INFO L796 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 3#L367-1true assume !!(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2020-07-29 01:39:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,492 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2020-07-29 01:39:35,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:35,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643167157] [2020-07-29 01:39:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2020-07-29 01:39:35,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:35,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075819307] [2020-07-29 01:39:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,765 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2020-07-29 01:39:35,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:35,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400514565] [2020-07-29 01:39:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,836 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:35,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:35,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:36,417 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2020-07-29 01:39:36,624 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-07-29 01:39:36,641 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:36,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:36,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:36,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:36,643 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:36,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:36,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:36,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:36,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat_diffterm_alloca.i_Iteration1_Lasso [2020-07-29 01:39:36,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:36,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:36,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:36,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:36,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:36,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:36,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,103 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-07-29 01:39:37,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:37,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:38,166 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:38,172 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:38,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:38,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:38,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:38,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:38,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:38,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:38,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:38,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:38,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:38,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:38,434 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:39:38,434 INFO L444 ModelExtractionUtils]: 12 out of 43 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:38,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:38,495 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:38,495 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:38,497 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1, ULTIMATE.start_cstrncat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0.offset Supporting invariants [] [2020-07-29 01:39:38,603 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:39:38,610 INFO L393 LassoCheck]: Loop: "call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1);" "assume !!(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset;" [2020-07-29 01:39:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:39:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:38,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2020-07-29 01:39:38,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; {28#unseeded} is VALID [2020-07-29 01:39:38,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length1~0 < 1); {28#unseeded} is VALID [2020-07-29 01:39:38,734 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !(main_~length2~0 < 1); {28#unseeded} is VALID [2020-07-29 01:39:38,734 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#unseeded} assume !(main_~n~0 < 1); {28#unseeded} is VALID [2020-07-29 01:39:38,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#unseeded} assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; {87#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrncat_~s~0.base) unseeded)} is VALID [2020-07-29 01:39:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,748 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:39:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:38,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:38,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrncat_~s~0.base) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrncat_~s~0.offset))))} call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); {111#(and (<= (+ ULTIMATE.start_cstrncat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrncat_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ oldRank0 ULTIMATE.start_cstrncat_~s~0.offset)) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrncat_~s~0.base))} is VALID [2020-07-29 01:39:38,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {111#(and (<= (+ ULTIMATE.start_cstrncat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrncat_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ oldRank0 ULTIMATE.start_cstrncat_~s~0.offset)) (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrncat_~s~0.base))} assume !!(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, 1 + cstrncat_#t~post206.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; {90#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrncat_~s~0.base) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrncat_~s~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:39:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:38,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:38,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:38,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:38,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:38,828 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:39:38,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-07-29 01:39:39,036 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 50 states and 73 transitions. Complement of second has 8 states. [2020-07-29 01:39:39,038 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 [2020-07-29 01:39:39,038 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:39,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:39,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:39:39,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:39,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:39,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 73 transitions. [2020-07-29 01:39:39,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 01:39:39,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:39:39,077 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:39:39,077 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:39,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:39,086 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:39,087 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 73 transitions. cyclomatic complexity: 27 [2020-07-29 01:39:39,088 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:39,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:39:39,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:39:39,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:39:39,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:39:39,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:39:39,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:39:39,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:39,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:39,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:39,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:39:39,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:39,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:39,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:39,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:39,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:39,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:39,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:39,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:39,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:39,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:39,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:39:39,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:39:39,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:39:39,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:39:39,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:39:39,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:39:39,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 73 transitions. cyclomatic complexity: 27 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:39:39,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,124 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-29 01:39:39,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:39,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:39,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:39:39,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:39,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 73 transitions. cyclomatic complexity: 27 [2020-07-29 01:39:39,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 20 states and 27 transitions. [2020-07-29 01:39:39,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:39,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:39,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-07-29 01:39:39,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:39,157 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 01:39:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-07-29 01:39:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-29 01:39:39,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:39,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand 19 states. [2020-07-29 01:39:39,188 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand 19 states. [2020-07-29 01:39:39,191 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 19 states. [2020-07-29 01:39:39,195 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:39,199 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2020-07-29 01:39:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2020-07-29 01:39:39,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:39,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:39,202 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states and 27 transitions. [2020-07-29 01:39:39,202 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states and 27 transitions. [2020-07-29 01:39:39,203 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:39,207 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-29 01:39:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-29 01:39:39,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:39,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:39,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:39,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:39:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 01:39:39,212 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:39:39,212 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:39:39,212 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:39,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:39:39,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:39,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:39,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:39,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:39,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:39,215 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 177#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 178#L381 assume !(main_~length1~0 < 1); 187#L381-2 assume !(main_~length2~0 < 1); 193#L384-1 assume !(main_~n~0 < 1); 188#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 189#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 179#L367-1 assume !(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 180#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 195#L369 assume !cstrncat_#t~short209; 191#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 194#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 184#L369 [2020-07-29 01:39:39,215 INFO L796 eck$LassoCheckResult]: Loop: 184#L369 assume !cstrncat_#t~short209; 190#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 183#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 184#L369 [2020-07-29 01:39:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2020-07-29 01:39:39,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755946634] [2020-07-29 01:39:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,278 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {303#true} is VALID [2020-07-29 01:39:39,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {303#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; {303#true} is VALID [2020-07-29 01:39:39,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#true} assume !(main_~length1~0 < 1); {303#true} is VALID [2020-07-29 01:39:39,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {303#true} assume !(main_~length2~0 < 1); {303#true} is VALID [2020-07-29 01:39:39,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {303#true} assume !(main_~n~0 < 1); {303#true} is VALID [2020-07-29 01:39:39,280 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#true} assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; {303#true} is VALID [2020-07-29 01:39:39,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#true} call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); {303#true} is VALID [2020-07-29 01:39:39,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#true} assume !(49 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; {303#true} is VALID [2020-07-29 01:39:39,281 INFO L280 TraceCheckUtils]: 8: Hoare triple {303#true} cstrncat_#t~short209 := 0 != cstrncat_~n; {303#true} is VALID [2020-07-29 01:39:39,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#true} assume !cstrncat_#t~short209; {305#(not |ULTIMATE.start_cstrncat_#t~short209|)} is VALID [2020-07-29 01:39:39,284 INFO L280 TraceCheckUtils]: 10: Hoare triple {305#(not |ULTIMATE.start_cstrncat_#t~short209|)} assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; {304#false} is VALID [2020-07-29 01:39:39,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {304#false} cstrncat_#t~short209 := 0 != cstrncat_~n; {304#false} is VALID [2020-07-29 01:39:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:39,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755946634] [2020-07-29 01:39:39,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:39,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:39:39,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878727560] [2020-07-29 01:39:39,290 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:39:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2020-07-29 01:39:39,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:39,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407513126] [2020-07-29 01:39:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:39,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#true} assume !cstrncat_#t~short209; {308#(not |ULTIMATE.start_cstrncat_#t~short209|)} is VALID [2020-07-29 01:39:39,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {308#(not |ULTIMATE.start_cstrncat_#t~short209|)} assume !!cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, 1 + cstrncat_#t~post211.offset;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; {307#false} is VALID [2020-07-29 01:39:39,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#false} cstrncat_#t~short209 := 0 != cstrncat_~n; {307#false} is VALID [2020-07-29 01:39:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:39,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407513126] [2020-07-29 01:39:39,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:39,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:39,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522652731] [2020-07-29 01:39:39,305 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:39,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:39:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:39:39,309 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:39:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:39,361 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-07-29 01:39:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:39:39,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:39,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:39,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2020-07-29 01:39:39,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:39,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-29 01:39:39,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:39,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:39,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:39,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:39,369 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:39,369 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:39,370 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:39,370 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:39,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:39,370 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:39,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:39,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:39 BoogieIcfgContainer [2020-07-29 01:39:39,378 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:39,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:39,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:39,379 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:39,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:35" (3/4) ... [2020-07-29 01:39:39,384 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:39,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:39,386 INFO L168 Benchmark]: Toolchain (without parser) took 5496.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 952.2 MB in the beginning and 965.3 MB in the end (delta: -13.1 MB). Peak memory consumption was 199.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:39,387 INFO L168 Benchmark]: CDTParser took 1.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:39,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:39,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:39,389 INFO L168 Benchmark]: Boogie Preprocessor took 31.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:39,391 INFO L168 Benchmark]: RCFGBuilder took 565.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:39,392 INFO L168 Benchmark]: BuchiAutomizer took 4056.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 114.1 MB). Peak memory consumption was 183.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:39,393 INFO L168 Benchmark]: Witness Printer took 5.71 ms. Allocated memory is still 1.2 GB. Free memory is still 965.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:39,397 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 773.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 565.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4056.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 114.1 MB). Peak memory consumption was 183.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.71 ms. Allocated memory is still 1.2 GB. Free memory is still 965.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * s 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 4.0s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 34 SDslu, 20 SDs, 0 SdLazy, 19 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital198 mio100 ax100 hnf98 lsp96 ukn76 mio100 lsp43 div100 bol100 ite100 ukn100 eq187 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...