./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 32bit --witnessprinter.graph.data.programhash 834e1cdb1aa87972c4591e301e8fffc5992d43b8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:20:09,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:09,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:20:09,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:20:09,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:20:09,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:20:09,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:20:09,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:20:09,749 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:20:09,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:20:09,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:20:09,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:20:09,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:20:09,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:20:09,763 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:20:09,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:20:09,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:20:09,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:20:09,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:20:09,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:20:09,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:20:09,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:20:09,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:20:09,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:20:09,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:20:09,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:20:09,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:20:09,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:20:09,787 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:20:09,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:20:09,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:20:09,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:20:09,789 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:20:09,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:20:09,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:20:09,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:20:09,792 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:20:09,816 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:20:09,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:20:09,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:20:09,821 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:20:09,821 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:20:09,822 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:20:09,822 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:20:09,822 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:20:09,822 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:20:09,822 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:20:09,823 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:20:09,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:20:09,824 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:20:09,825 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:20:09,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:20:09,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:20:09,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:20:09,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:20:09,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:20:09,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:20:09,826 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:20:09,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:20:09,827 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:20:09,827 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:20:09,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:20:09,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:20:09,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:20:09,829 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:20:09,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:20:09,829 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:20:09,829 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:20:09,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:20:09,831 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 834e1cdb1aa87972c4591e301e8fffc5992d43b8 [2019-01-02 00:20:09,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:20:09,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:20:09,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:20:09,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:20:09,901 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:20:09,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:09,979 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c573d1f/dc009a6e360345bdbbeef29907943a82/FLAG984c827a9 [2019-01-02 00:20:10,518 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:20:10,519 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:10,538 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c573d1f/dc009a6e360345bdbbeef29907943a82/FLAG984c827a9 [2019-01-02 00:20:10,783 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c573d1f/dc009a6e360345bdbbeef29907943a82 [2019-01-02 00:20:10,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:20:10,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:20:10,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:10,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:20:10,794 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:20:10,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:10" (1/1) ... [2019-01-02 00:20:10,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3840c0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:10, skipping insertion in model container [2019-01-02 00:20:10,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:10" (1/1) ... [2019-01-02 00:20:10,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:20:10,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:20:11,219 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:11,242 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:20:11,368 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:11,432 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:20:11,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11 WrapperNode [2019-01-02 00:20:11,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:11,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:11,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:20:11,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:20:11,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:11,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:20:11,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:20:11,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:20:11,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (1/1) ... [2019-01-02 00:20:11,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:20:11,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:20:11,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:20:11,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:20:11,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (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 [2019-01-02 00:20:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:20:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:20:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:20:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:20:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:20:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:20:11,954 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:20:11,954 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-02 00:20:11,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:11 BoogieIcfgContainer [2019-01-02 00:20:11,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:20:11,956 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:20:11,957 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:20:11,961 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:20:11,962 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:11,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:20:10" (1/3) ... [2019-01-02 00:20:11,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32c35d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:11, skipping insertion in model container [2019-01-02 00:20:11,963 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:11,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:11" (2/3) ... [2019-01-02 00:20:11,965 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32c35d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:11, skipping insertion in model container [2019-01-02 00:20:11,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:11,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:11" (3/3) ... [2019-01-02 00:20:11,967 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:12,039 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:20:12,040 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:20:12,040 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:20:12,040 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:20:12,041 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:20:12,041 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:20:12,041 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:20:12,041 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:20:12,041 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:20:12,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:20:12,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:12,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:12,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:12,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:12,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:12,088 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:20:12,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:20:12,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:12,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:12,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:12,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:12,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:12,099 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9.base, main_#t~ret9.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 13#L550true assume !(main_~length1~0 < 1); 3#L550-2true assume !(main_~length2~0 < 1); 8#L553-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~to.base, cstrcpy_#in~to.offset, cstrcpy_#in~from.base, cstrcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset, cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset, cstrcpy_#t~mem4, cstrcpy_~to.base, cstrcpy_~to.offset, cstrcpy_~from.base, cstrcpy_~from.offset, cstrcpy_~save~0.base, cstrcpy_~save~0.offset;cstrcpy_~to.base, cstrcpy_~to.offset := cstrcpy_#in~to.base, cstrcpy_#in~to.offset;cstrcpy_~from.base, cstrcpy_~from.offset := cstrcpy_#in~from.base, cstrcpy_#in~from.offset;cstrcpy_~save~0.base, cstrcpy_~save~0.offset := cstrcpy_~to.base, cstrcpy_~to.offset; 10#L544-4true [2019-01-02 00:20:12,100 INFO L796 eck$LassoCheckResult]: Loop: 10#L544-4true call cstrcpy_#t~mem4 := read~int(cstrcpy_~from.base, cstrcpy_~from.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_~to.base, cstrcpy_~to.offset, 1); 5#L544-1true assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~mem4; 9#L544-3true cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset := cstrcpy_~from.base, 1 + cstrcpy_~from.offset;cstrcpy_~from.base, cstrcpy_~from.offset := cstrcpy_~from.base, 1 + cstrcpy_~from.offset;havoc cstrcpy_#t~pre2.base, cstrcpy_#t~pre2.offset;cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset := cstrcpy_~to.base, 1 + cstrcpy_~to.offset;cstrcpy_~to.base, cstrcpy_~to.offset := cstrcpy_~to.base, 1 + cstrcpy_~to.offset;havoc cstrcpy_#t~pre3.base, cstrcpy_#t~pre3.offset; 10#L544-4true [2019-01-02 00:20:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-01-02 00:20:12,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:12,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:12,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash 52792, now seen corresponding path program 1 times [2019-01-02 00:20:12,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:12,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:12,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash 180551759, now seen corresponding path program 1 times [2019-01-02 00:20:12,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:12,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:12,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:12,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,538 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-02 00:20:12,748 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-02 00:20:13,376 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-01-02 00:20:13,773 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-02 00:20:13,798 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:13,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:13,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:13,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:13,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:13,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:13,802 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:13,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:13,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:20:13,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:13,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:13,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:13,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,349 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-01-02 00:20:14,542 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-02 00:20:14,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:14,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:15,107 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:20:15,706 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-02 00:20:15,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:15,958 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:15,961 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 [2019-01-02 00:20:15,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:15,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:15,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:15,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:15,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:15,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:15,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:15,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:15,971 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 [2019-01-02 00:20:15,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:15,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:15,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:15,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:15,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:15,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:15,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:15,985 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 [2019-01-02 00:20:15,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:15,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:15,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:15,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:15,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:15,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:15,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:15,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:15,990 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 [2019-01-02 00:20:15,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:15,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:15,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:15,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:15,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:15,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,012 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 [2019-01-02 00:20:16,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:16,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,014 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:20:16,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:20:16,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:16,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,021 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 [2019-01-02 00:20:16,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,022 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:16,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,034 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:16,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,128 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 [2019-01-02 00:20:16,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:16,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,137 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 [2019-01-02 00:20:16,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:16,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,155 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 [2019-01-02 00:20:16,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:16,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,162 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 [2019-01-02 00:20:16,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:16,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,265 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:16,326 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-02 00:20:16,327 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:20:16,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:16,331 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:16,332 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:16,332 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~from.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrcpy_~from.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2019-01-02 00:20:16,502 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-02 00:20:16,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:16,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:16,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:16,701 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 [2019-01-02 00:20:16,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-02 00:20:16,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2019-01-02 00:20:16,827 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 [2019-01-02 00:20:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:20:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-02 00:20:16,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-02 00:20:16,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:16,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-02 00:20:16,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:16,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-02 00:20:16,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:16,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-01-02 00:20:16,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:16,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-01-02 00:20:16,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:20:16,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:20:16,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:20:16,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:20:16,851 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:16,851 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:16,852 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:16,852 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:20:16,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:20:16,852 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:16,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:20:16,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:20:16 BoogieIcfgContainer [2019-01-02 00:20:16,860 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:20:16,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:20:16,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:20:16,862 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:20:16,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:11" (3/4) ... [2019-01-02 00:20:16,867 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:20:16,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:20:16,868 INFO L168 Benchmark]: Toolchain (without parser) took 6080.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:16,871 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:20:16,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:16,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.63 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. [2019-01-02 00:20:16,875 INFO L168 Benchmark]: Boogie Preprocessor took 26.90 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. [2019-01-02 00:20:16,876 INFO L168 Benchmark]: RCFGBuilder took 436.80 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:16,877 INFO L168 Benchmark]: BuchiAutomizer took 4903.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 70.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:16,879 INFO L168 Benchmark]: Witness Printer took 7.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. [2019-01-02 00:20:16,885 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.90 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 436.80 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4903.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 70.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.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. * 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * from + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. 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 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 16 SDslu, 3 SDs, 0 SdLazy, 6 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital202 mio100 ax100 hnf99 lsp97 ukn92 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf179 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 104ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...