./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-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_cstrcmp-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 cbb495583d601bf9f19d9da57531415381b22d5a ............................................................................................................................................................................................................................................................................................................................................................................................................................... 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:08,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:08,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:20:08,827 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:20:08,828 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:20:08,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:20:08,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:20:08,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:20:08,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:20:08,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:20:08,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:20:08,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:20:08,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:20:08,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:20:08,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:20:08,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:20:08,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:20:08,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:20:08,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:20:08,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:20:08,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:20:08,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:20:08,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:20:08,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:20:08,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:20:08,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:20:08,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:20:08,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:20:08,874 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:20:08,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:20:08,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:20:08,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:20:08,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:20:08,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:20:08,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:20:08,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:20:08,879 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:08,896 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:20:08,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:20:08,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:20:08,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:20:08,899 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:20:08,899 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:20:08,899 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:20:08,899 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:20:08,899 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:20:08,900 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:20:08,900 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:20:08,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:20:08,900 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:20:08,900 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:20:08,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:20:08,902 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:20:08,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:20:08,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:20:08,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:20:08,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:20:08,903 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:20:08,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:20:08,903 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:20:08,903 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:20:08,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:20:08,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:20:08,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:20:08,905 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:20:08,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:20:08,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:20:08,905 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:20:08,906 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:20:08,907 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 -> cbb495583d601bf9f19d9da57531415381b22d5a [2019-01-02 00:20:08,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:20:08,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:20:08,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:20:08,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:20:08,971 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:20:08,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:09,036 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd11081e/614c02c081e34f0dab21db9e5a5d102f/FLAG2c94614ee [2019-01-02 00:20:09,567 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:20:09,568 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:09,581 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd11081e/614c02c081e34f0dab21db9e5a5d102f/FLAG2c94614ee [2019-01-02 00:20:09,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cd11081e/614c02c081e34f0dab21db9e5a5d102f [2019-01-02 00:20:09,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:20:09,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:20:09,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:09,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:20:09,862 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:20:09,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:09" (1/1) ... [2019-01-02 00:20:09,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3942d629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:09, skipping insertion in model container [2019-01-02 00:20:09,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:09" (1/1) ... [2019-01-02 00:20:09,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:20:09,933 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:20:10,309 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:10,325 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:20:10,398 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:10,539 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:20:10,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:10 WrapperNode [2019-01-02 00:20:10,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:10,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:10,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:20:10,540 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:20:10,551 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:10" (1/1) ... [2019-01-02 00:20:10,574 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:10" (1/1) ... [2019-01-02 00:20:10,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:10,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:20:10,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:20:10,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:20:10,619 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:10" (1/1) ... [2019-01-02 00:20:10,619 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:10" (1/1) ... [2019-01-02 00:20:10,626 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:10" (1/1) ... [2019-01-02 00:20:10,626 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:10" (1/1) ... [2019-01-02 00:20:10,644 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:10" (1/1) ... [2019-01-02 00:20:10,654 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:10" (1/1) ... [2019-01-02 00:20:10,656 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:10" (1/1) ... [2019-01-02 00:20:10,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:20:10,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:20:10,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:20:10,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:20:10,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:10" (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:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:20:10,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:20:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:20:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:20:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:20:10,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:20:11,234 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:20:11,234 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-02 00:20:11,235 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,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:20:11,236 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:20:11,236 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:20:11,241 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:20:11,242 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:11,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:20:09" (1/3) ... [2019-01-02 00:20:11,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ff49533 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,243 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:11,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:10" (2/3) ... [2019-01-02 00:20:11,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ff49533 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,245 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:11,245 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,247 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:11,308 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:20:11,309 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:20:11,309 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:20:11,309 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:20:11,310 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:20:11,310 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:20:11,310 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:20:11,310 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:20:11,310 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:20:11,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:20:11,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:11,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:11,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:11,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:11,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:11,358 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:20:11,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:20:11,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-02 00:20:11,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:11,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:11,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:20:11,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:11,370 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 9#L551true assume !(main_~length1~0 < 1); 15#L551-2true assume !(main_~length2~0 < 1); 6#L554-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset; 10#L543-3true [2019-01-02 00:20:11,370 INFO L796 eck$LassoCheckResult]: Loop: 10#L543-3true call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 7#L543-1true assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 4#L544true assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 10#L543-3true [2019-01-02 00:20:11,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:11,377 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-02 00:20:11,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:11,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 1 times [2019-01-02 00:20:11,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:11,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2019-01-02 00:20:11,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:11,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:11,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:12,196 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-02 00:20:12,322 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-02 00:20:13,151 WARN L181 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-02 00:20:13,533 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-02 00:20:13,564 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:13,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:13,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:13,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:13,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:13,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:13,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:13,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:13,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:20:13,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:13,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:13,612 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,645 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,669 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,708 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,731 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,548 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-02 00:20:14,751 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:20:14,751 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,758 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,760 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,765 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,771 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,773 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,774 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,784 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,786 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,788 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,790 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,811 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,823 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,825 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,108 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-02 00:20:15,858 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-02 00:20:16,005 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:16,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:16,013 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,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:16,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:16,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:16,021 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,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:16,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:16,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:16,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,024 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,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:16,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,033 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,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:16,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:16,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:16,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:16,035 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,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:16,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:16,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:16,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:16,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:16,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:16,161 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:16,257 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:20:16,259 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:20:16,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:16,264 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:16,264 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:16,265 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2019-01-02 00:20:16,486 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-01-02 00:20:16,499 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:16,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:16,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:16,729 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,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-02 00:20:16,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-02 00:20:16,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 22 states and 28 transitions. Complement of second has 5 states. [2019-01-02 00:20:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 0 non-accepting loop states 2 accepting loop states [2019-01-02 00:20:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:20:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-02 00:20:16,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-02 00:20:16,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:16,845 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-02 00:20:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:16,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:16,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:17,087 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:17,088 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-02 00:20:17,088 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-01-02 00:20:17,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 25 states and 30 transitions. Complement of second has 10 states. [2019-01-02 00:20:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-02 00:20:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:20:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-02 00:20:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-02 00:20:17,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-02 00:20:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:17,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-02 00:20:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:17,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2019-01-02 00:20:17,282 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:17,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-01-02 00:20:17,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:20:17,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:20:17,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:20:17,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:20:17,287 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:17,287 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:17,287 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:17,287 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:20:17,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:20:17,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:17,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:20:17,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:20:17 BoogieIcfgContainer [2019-01-02 00:20:17,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:20:17,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:20:17,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:20:17,295 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:20:17,295 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:17,298 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:20:17,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:20:17,299 INFO L168 Benchmark]: Toolchain (without parser) took 7442.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -107.7 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:17,300 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:20:17,301 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:17,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:17,302 INFO L168 Benchmark]: Boogie Preprocessor took 56.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:20:17,303 INFO L168 Benchmark]: RCFGBuilder took 570.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:17,304 INFO L168 Benchmark]: BuchiAutomizer took 6058.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:17,305 INFO L168 Benchmark]: Witness Printer took 3.92 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:17,312 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 570.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6058.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.92 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 * s2 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. 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 [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 16 SDslu, 5 SDs, 0 SdLazy, 21 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf166 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...