./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer --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 493d4075183da22c41b393b09f987b5f1b55266e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 11:51:16,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:16,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:16,728 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:16,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:16,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:16,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:16,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:16,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:16,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:16,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:16,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:16,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:16,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:16,735 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:16,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:16,736 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:16,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:16,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:16,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:16,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:16,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:16,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:16,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:16,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:16,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:16,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:16,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:16,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:16,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:16,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:16,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:16,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:16,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:16,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:16,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:16,746 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 11:51:16,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:16,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:16,755 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:16,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:16,756 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:16,756 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 11:51:16,756 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 11:51:16,756 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 11:51:16,756 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 11:51:16,756 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 11:51:16,757 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 11:51:16,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:16,757 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 11:51:16,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:16,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:16,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 11:51:16,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 11:51:16,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:16,758 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 11:51:16,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:16,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:16,759 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 11:51:16,760 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 11:51:16,760 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer 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 -> 493d4075183da22c41b393b09f987b5f1b55266e [2018-11-23 11:51:16,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:16,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:16,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:16,797 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:16,797 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:16,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i [2018-11-23 11:51:16,837 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/data/76a1aca12/7a52e4780e1d4a838f80e27d9acad5d0/FLAG1850745a4 [2018-11-23 11:51:17,288 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:17,288 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i [2018-11-23 11:51:17,294 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/data/76a1aca12/7a52e4780e1d4a838f80e27d9acad5d0/FLAG1850745a4 [2018-11-23 11:51:17,305 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/data/76a1aca12/7a52e4780e1d4a838f80e27d9acad5d0 [2018-11-23 11:51:17,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:17,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:17,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:17,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:17,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:17,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28603259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17, skipping insertion in model container [2018-11-23 11:51:17,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:17,352 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:17,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:17,575 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:17,654 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:17,694 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:17,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17 WrapperNode [2018-11-23 11:51:17,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:17,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:17,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:17,695 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:17,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:17,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:17,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:17,720 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:17,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... [2018-11-23 11:51:17,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:17,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:17,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:17,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:17,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_615093dd-604f-4c40-a542-6f82db0d21f5/bin-2019/uautomizer/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-23 11:51:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:17,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:17,942 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:17,943 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:51:17,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:17 BoogieIcfgContainer [2018-11-23 11:51:17,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:17,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 11:51:17,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 11:51:17,946 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 11:51:17,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:51:17,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 11:51:17" (1/3) ... [2018-11-23 11:51:17,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@268eb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:51:17, skipping insertion in model container [2018-11-23 11:51:17,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:51:17,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:17" (2/3) ... [2018-11-23 11:51:17,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@268eb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 11:51:17, skipping insertion in model container [2018-11-23 11:51:17,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 11:51:17,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:17" (3/3) ... [2018-11-23 11:51:17,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_mixed_alloca_true-termination.c.i [2018-11-23 11:51:17,982 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:17,982 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 11:51:17,983 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 11:51:17,983 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 11:51:17,983 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:17,983 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:17,983 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 11:51:17,983 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:17,983 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 11:51:17,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 11:51:18,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 11:51:18,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:18,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:18,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 11:51:18,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:51:18,013 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 11:51:18,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 11:51:18,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 11:51:18,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:18,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:18,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 11:51:18,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:51:18,019 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2018-11-23 11:51:18,020 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2018-11-23 11:51:18,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 11:51:18,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:18,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:18,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:18,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-11-23 11:51:18,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:18,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:18,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:18,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-11-23 11:51:18,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:18,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:18,503 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-11-23 11:51:18,571 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:51:18,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:51:18,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:51:18,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:51:18,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:51:18,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:51:18,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:51:18,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:51:18,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 11:51:18,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:51:18,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:51:18,592 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-23 11:51:18,783 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-11-23 11:51:18,871 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-23 11:51:18,872 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-23 11:51:18,873 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-23 11:51:18,874 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-23 11:51:18,876 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-23 11:51:18,877 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-23 11:51:18,878 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-23 11:51:18,879 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-23 11:51:18,881 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-23 11:51:18,882 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-23 11:51:18,883 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-23 11:51:18,884 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-23 11:51:18,885 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-23 11:51:18,886 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-23 11:51:18,887 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-23 11:51:18,889 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-23 11:51:18,890 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-23 11:51:18,891 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-23 11:51:18,894 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-23 11:51:18,895 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-23 11:51:18,896 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-23 11:51:19,232 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:51:19,236 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:51:19,238 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-23 11:51:19,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:19,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:19,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:19,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:19,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:19,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:19,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:51:19,316 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 11:51:19,316 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 11:51:19,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:51:19,319 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 11:51:19,320 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:51:19,320 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2018-11-23 11:51:19,357 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-23 11:51:19,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:19,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:19,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:19,426 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-23 11:51:19,435 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-23 11:51:19,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-23 11:51:19,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2018-11-23 11:51:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 11:51:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 11:51:19,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 11:51:19,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:19,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 11:51:19,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:19,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 11:51:19,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:19,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-23 11:51:19,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:51:19,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2018-11-23 11:51:19,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 11:51:19,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 11:51:19,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-23 11:51:19,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:19,473 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-23 11:51:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-23 11:51:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 11:51:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 11:51:19,490 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 11:51:19,490 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 11:51:19,490 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 11:51:19,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 11:51:19,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 11:51:19,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 11:51:19,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 11:51:19,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:19,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 11:51:19,491 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 141#L385 assume !(main_~length~0 < 1); 146#L385-2 assume !(main_~n~0 < 1); 144#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 145#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 137#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 139#L375-3 [2018-11-23 11:51:19,491 INFO L796 eck$LassoCheckResult]: Loop: 139#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 142#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 139#L375-3 [2018-11-23 11:51:19,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-11-23 11:51:19,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:19,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:19,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:19,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:19,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-23 11:51:19,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:19,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-11-23 11:51:19,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:19,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:19,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:19,846 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 125 [2018-11-23 11:51:19,985 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-11-23 11:51:19,986 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 11:51:19,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 11:51:19,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 11:51:19,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 11:51:19,987 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 11:51:19,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 11:51:19,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 11:51:19,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 11:51:19,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 11:51:19,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 11:51:19,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 11:51:19,991 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-23 11:51:19,996 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-23 11:51:20,193 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-11-23 11:51:20,235 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-23 11:51:20,236 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-23 11:51:20,237 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-23 11:51:20,238 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-23 11:51:20,239 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-23 11:51:20,240 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-23 11:51:20,241 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-23 11:51:20,242 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-23 11:51:20,243 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-23 11:51:20,244 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-23 11:51:20,245 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-23 11:51:20,246 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-23 11:51:20,247 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-23 11:51:20,248 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-23 11:51:20,248 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-23 11:51:20,249 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-23 11:51:20,250 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-23 11:51:20,251 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-23 11:51:20,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 11:51:20,552 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 11:51:20,553 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-23 11:51:20,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:20,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:20,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:20,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:20,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:20,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:20,556 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-23 11:51:20,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,556 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:51:20,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:20,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,559 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:51:20,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:20,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:20,567 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-23 11:51:20,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 11:51:20,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:20,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:20,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 11:51:20,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 11:51:20,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:20,570 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-23 11:51:20,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,570 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 11:51:20,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:20,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,576 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 11:51:20,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:20,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:20,586 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-23 11:51:20,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:20,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:20,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:20,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:20,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:20,590 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-23 11:51:20,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:20,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 11:51:20,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 11:51:20,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 11:51:20,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 11:51:20,594 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-23 11:51:20,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 11:51:20,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 11:51:20,596 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 11:51:20,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 11:51:20,604 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 11:51:20,604 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 11:51:20,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 11:51:20,718 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 11:51:20,718 INFO L444 ModelExtractionUtils]: 60 out of 66 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 11:51:20,718 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 11:51:20,720 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 11:51:20,720 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 11:51:20,720 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset) = 2*ULTIMATE.start_cstrncpy_~us~0.offset + 1 Supporting invariants [] [2018-11-23 11:51:20,765 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-23 11:51:20,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:20,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:20,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:20,812 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-23 11:51:20,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 11:51:20,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 11:51:20,818 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 16 transitions. Complement of second has 4 states. [2018-11-23 11:51:20,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 11:51:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-23 11:51:20,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 11:51:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:20,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 11:51:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:20,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 11:51:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 11:51:20,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-11-23 11:51:20,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:51:20,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-23 11:51:20,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 11:51:20,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 11:51:20,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 11:51:20,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 11:51:20,823 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:51:20,823 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:51:20,823 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:51:20,823 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 11:51:20,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:51:20,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 11:51:20,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 11:51:20,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 11:51:20 BoogieIcfgContainer [2018-11-23 11:51:20,831 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 11:51:20,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:51:20,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:51:20,832 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:51:20,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:17" (3/4) ... [2018-11-23 11:51:20,835 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 11:51:20,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:51:20,835 INFO L168 Benchmark]: Toolchain (without parser) took 3527.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 956.5 MB in the beginning and 970.0 MB in the end (delta: -13.5 MB). Peak memory consumption was 165.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:20,836 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:20,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:20,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.88 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:20,837 INFO L168 Benchmark]: Boogie Preprocessor took 18.23 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. [2018-11-23 11:51:20,838 INFO L168 Benchmark]: RCFGBuilder took 204.63 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:20,838 INFO L168 Benchmark]: BuchiAutomizer took 2887.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 118.5 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:20,838 INFO L168 Benchmark]: Witness Printer took 3.51 ms. Allocated memory is still 1.2 GB. Free memory is still 970.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:20,841 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.88 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.23 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. * RCFGBuilder took 204.63 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2887.45 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 970.0 MB in the end (delta: 118.5 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.51 ms. Allocated memory is still 1.2 GB. Free memory is still 970.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function 2 * us + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 26 SDslu, 9 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax100 hnf99 lsp96 ukn84 mio100 lsp35 div100 bol100 ite100 ukn100 eq198 hnf89 smp100 dnf115 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 126ms VariablesStem: 12 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...