./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncat_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-15/cstrncat_malloc_true-termination.c.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 57af49b15bb2f44ef5afe346e632fe87804775c2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:23:26,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:26,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:26,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:26,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:26,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:26,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:26,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:26,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:26,708 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:26,709 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:26,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:26,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:26,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:26,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:26,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:26,721 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:26,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:26,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:26,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:26,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:26,738 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:26,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:26,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:26,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:26,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:26,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:26,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:26,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:26,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:26,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:26,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:26,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:26,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:26,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:26,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:26,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:23:26,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:26,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:26,785 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:26,785 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:26,786 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:26,786 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:26,786 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:26,786 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:26,786 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:26,786 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:26,787 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:26,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:26,787 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:26,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:26,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:26,787 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:26,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:26,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:26,788 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:26,788 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:26,788 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:26,788 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:26,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:26,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:26,789 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:26,789 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:26,789 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:26,790 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:26,790 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:26,791 INFO L133 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 -> 57af49b15bb2f44ef5afe346e632fe87804775c2 [2018-11-28 23:23:26,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:26,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:26,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:26,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:26,849 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:26,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncat_malloc_true-termination.c.i [2018-11-28 23:23:26,914 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5728d8fbb/8d551ad9749c4f6ab0a06d0ca248e04e/FLAG04ed2e26c [2018-11-28 23:23:27,445 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:27,447 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncat_malloc_true-termination.c.i [2018-11-28 23:23:27,466 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5728d8fbb/8d551ad9749c4f6ab0a06d0ca248e04e/FLAG04ed2e26c [2018-11-28 23:23:27,736 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5728d8fbb/8d551ad9749c4f6ab0a06d0ca248e04e [2018-11-28 23:23:27,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:27,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:27,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:27,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:27,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:27,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:27" (1/1) ... [2018-11-28 23:23:27,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c9417b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:27, skipping insertion in model container [2018-11-28 23:23:27,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:27" (1/1) ... [2018-11-28 23:23:27,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:27,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:28,221 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:28,235 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:28,307 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:28,462 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:28,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28 WrapperNode [2018-11-28 23:23:28,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:28,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:28,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:28,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:28,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:28,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:28,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:28,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:28,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (1/1) ... [2018-11-28 23:23:28,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:28,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:28,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:28,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:28,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (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 [2018-11-28 23:23:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:28,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:29,083 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:29,084 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:23:29,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:29 BoogieIcfgContainer [2018-11-28 23:23:29,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:29,085 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:29,085 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:29,089 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:29,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:29,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:27" (1/3) ... [2018-11-28 23:23:29,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22262f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:29, skipping insertion in model container [2018-11-28 23:23:29,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:29,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:28" (2/3) ... [2018-11-28 23:23:29,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22262f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:29, skipping insertion in model container [2018-11-28 23:23:29,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:29,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:29" (3/3) ... [2018-11-28 23:23:29,094 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncat_malloc_true-termination.c.i [2018-11-28 23:23:29,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:29,154 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:29,154 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:29,154 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:29,154 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:29,155 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:29,155 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:29,155 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:29,155 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:29,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:23:29,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:23:29,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:29,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:29,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:23:29,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:29,208 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:29,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:23:29,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-28 23:23:29,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:29,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:29,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:23:29,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:29,221 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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); 6#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.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, 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 [2018-11-28 23:23:29,222 INFO L796 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 4#L367-1true assume !!(0 != 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 [2018-11-28 23:23:29,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2018-11-28 23:23:29,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:29,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:29,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:29,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:29,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:29,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2018-11-28 23:23:29,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:29,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:29,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:29,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2018-11-28 23:23:29,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:29,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:29,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:29,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:30,710 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2018-11-28 23:23:30,959 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 23:23:30,985 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:30,987 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:30,987 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:30,987 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:30,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:30,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:30,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:30,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:30,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_malloc_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:23:30,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:30,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,617 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-11-28 23:23:31,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:31,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:32,497 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:23:32,570 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:32,577 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:32,579 INFO L122 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 [2018-11-28 23:23:32,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,587 INFO L122 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 [2018-11-28 23:23:32,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:32,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:32,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,596 INFO L122 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 [2018-11-28 23:23:32,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,600 INFO L122 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 [2018-11-28 23:23:32,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,603 INFO L122 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 [2018-11-28 23:23:32,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,606 INFO L122 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 [2018-11-28 23:23:32,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,610 INFO L122 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 [2018-11-28 23:23:32,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,620 INFO L122 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 [2018-11-28 23:23:32,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:32,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:32,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:32,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,626 INFO L122 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 [2018-11-28 23:23:32,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:32,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:32,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:32,647 INFO L122 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 [2018-11-28 23:23:32,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:32,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:32,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:32,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:32,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:32,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:32,752 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:32,811 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:23:32,812 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:23:32,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:32,819 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:32,819 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:32,823 INFO L520 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 [] [2018-11-28 23:23:32,926 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:23:32,937 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:33,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:33,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:33,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:33,102 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 [2018-11-28 23:23:33,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2018-11-28 23:23:33,268 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2018-11-28 23:23:33,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2018-11-28 23:23:33,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:23:33,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:33,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:23:33,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:33,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:23:33,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:33,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2018-11-28 23:23:33,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:33,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2018-11-28 23:23:33,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:23:33,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:33,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-28 23:23:33,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:33,290 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-28 23:23:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-28 23:23:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-28 23:23:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:23:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-11-28 23:23:33,316 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:23:33,316 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:23:33,316 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:33,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-11-28 23:23:33,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:33,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:33,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:33,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:33,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:33,319 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 163#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; 164#L381 assume !(main_~length1~0 < 1); 169#L381-2 assume !(main_~length2~0 < 1); 179#L384-1 assume !(main_~n~0 < 1); 174#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.alloc(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.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1), 1);call write~int(0, 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; 175#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 165#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 166#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 181#L369 assume !cstrncat_#t~short209; 177#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;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; 180#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 171#L369 [2018-11-28 23:23:33,319 INFO L796 eck$LassoCheckResult]: Loop: 171#L369 assume !cstrncat_#t~short209; 176#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~short209;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;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; 170#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 171#L369 [2018-11-28 23:23:33,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2018-11-28 23:23:33,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:33,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:33,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:23:33,407 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:23:33,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2018-11-28 23:23:33,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:33,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:33,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:33,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:33,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:23:33,430 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:23:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:23:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:23:33,436 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-28 23:23:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:33,463 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-28 23:23:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:23:33,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2018-11-28 23:23:33,466 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:23:33,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2018-11-28 23:23:33,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:23:33,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:23:33,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:23:33,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:33,466 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:23:33,467 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:23:33,467 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:23:33,467 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:33,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:23:33,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:23:33,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:23:33,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:23:33 BoogieIcfgContainer [2018-11-28 23:23:33,473 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:23:33,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:23:33,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:23:33,474 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:23:33,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:29" (3/4) ... [2018-11-28 23:23:33,478 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:23:33,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:23:33,479 INFO L168 Benchmark]: Toolchain (without parser) took 5738.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.3 MB in the beginning and 774.2 MB in the end (delta: 177.1 MB). Peak memory consumption was 283.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:33,480 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:33,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:33,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:33,483 INFO L168 Benchmark]: Boogie Preprocessor took 54.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:33,483 INFO L168 Benchmark]: RCFGBuilder took 505.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:33,484 INFO L168 Benchmark]: BuchiAutomizer took 4388.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 774.2 MB in the end (delta: 292.7 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:33,485 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 1.1 GB. Free memory is still 774.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:33,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 720.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 505.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4388.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 774.2 MB in the end (delta: 292.7 MB). Peak memory consumption was 292.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.62 ms. Allocated memory is still 1.1 GB. Free memory is still 774.2 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[malloc(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.3s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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: 37 SDtfs, 41 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital197 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: 8ms 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...