./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/strreplace-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/strreplace-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 04214bcb8e1f50bae63b15c1fa309fb3edc667ba ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:05,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:21:05,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:21:05,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:21:05,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:21:05,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:21:05,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:21:05,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:21:05,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:21:05,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:21:05,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:21:05,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:21:05,456 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:21:05,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:21:05,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:21:05,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:21:05,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:21:05,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:21:05,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:21:05,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:21:05,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:21:05,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:21:05,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:21:05,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:21:05,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:21:05,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:21:05,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:21:05,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:21:05,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:21:05,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:21:05,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:21:05,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:21:05,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:21:05,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:21:05,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:21:05,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:21:05,497 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:21:05,525 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:21:05,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:21:05,528 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:21:05,528 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:21:05,528 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:21:05,528 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:21:05,529 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:21:05,529 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:21:05,529 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:21:05,529 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:21:05,529 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:21:05,529 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:21:05,531 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:21:05,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:21:05,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:21:05,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:21:05,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:21:05,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:21:05,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:21:05,532 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:21:05,532 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:21:05,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:21:05,532 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:21:05,532 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:21:05,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:21:05,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:21:05,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:21:05,534 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:21:05,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:21:05,535 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:21:05,535 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:21:05,536 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:21:05,536 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 -> 04214bcb8e1f50bae63b15c1fa309fb3edc667ba [2019-01-02 00:21:05,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:21:05,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:21:05,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:21:05,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:21:05,601 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:21:05,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:05,657 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13acf9408/d33507bd098344d4944a5eaa436cd415/FLAG51bedc061 [2019-01-02 00:21:06,139 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:21:06,139 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:06,155 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13acf9408/d33507bd098344d4944a5eaa436cd415/FLAG51bedc061 [2019-01-02 00:21:06,462 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13acf9408/d33507bd098344d4944a5eaa436cd415 [2019-01-02 00:21:06,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:21:06,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:21:06,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:06,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:21:06,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:21:06,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:06" (1/1) ... [2019-01-02 00:21:06,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5ec0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:06, skipping insertion in model container [2019-01-02 00:21:06,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:21:06" (1/1) ... [2019-01-02 00:21:06,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:21:06,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:21:06,940 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:06,962 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:21:07,031 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:21:07,104 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:21:07,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07 WrapperNode [2019-01-02 00:21:07,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:21:07,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:07,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:21:07,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:21:07,191 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:21:07" (1/1) ... [2019-01-02 00:21:07,210 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:21:07" (1/1) ... [2019-01-02 00:21:07,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:21:07,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:21:07,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:21:07,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:21:07,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (1/1) ... [2019-01-02 00:21:07,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:21:07,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:21:07,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:21:07,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:21:07,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (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:21:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:21:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:21:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:21:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:21:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:21:07,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:21:07,725 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:21:07,725 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-02 00:21:07,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:07 BoogieIcfgContainer [2019-01-02 00:21:07,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:21:07,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:21:07,728 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:21:07,731 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:21:07,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:07,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:21:06" (1/3) ... [2019-01-02 00:21:07,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4675dc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:07, skipping insertion in model container [2019-01-02 00:21:07,734 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:07,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:21:07" (2/3) ... [2019-01-02 00:21:07,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4675dc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:21:07, skipping insertion in model container [2019-01-02 00:21:07,735 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:21:07,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:07" (3/3) ... [2019-01-02 00:21:07,736 INFO L375 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:21:07,793 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:21:07,794 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:21:07,794 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:21:07,794 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:21:07,794 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:21:07,795 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:21:07,795 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:21:07,795 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:21:07,795 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:21:07,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:21:07,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:21:07,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:07,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:07,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:21:07,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:21:07,836 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:21:07,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-02 00:21:07,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:21:07,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:21:07,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:21:07,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:21:07,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:21:07,847 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~nondet9, main_#t~ret10, main_~length1~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6; 4#L555true assume !(main_~length1~0 < 1); 8#L555-2true call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrreplace_#in~s.base, cstrreplace_#in~s.offset, cstrreplace_#in~old, cstrreplace_#in~new := main_~nondetString1~0.base, main_~nondetString1~0.offset, (if main_#t~nondet8 % 256 <= 127 then main_#t~nondet8 % 256 else main_#t~nondet8 % 256 - 256), (if main_#t~nondet9 % 256 <= 127 then main_#t~nondet9 % 256 else main_#t~nondet9 % 256 - 256);havoc cstrreplace_#res;havoc cstrreplace_#t~mem3, cstrreplace_#t~post4, cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset, cstrreplace_#t~mem2, cstrreplace_~s.base, cstrreplace_~s.offset, cstrreplace_~old, cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, cstrreplace_~numReplaced~0;cstrreplace_~s.base, cstrreplace_~s.offset := cstrreplace_#in~s.base, cstrreplace_#in~s.offset;cstrreplace_~old := cstrreplace_#in~old;cstrreplace_~new := cstrreplace_#in~new;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_~s.base, cstrreplace_~s.offset;cstrreplace_~numReplaced~0 := 0; 10#L544-3true [2019-01-02 00:21:07,847 INFO L796 eck$LassoCheckResult]: Loop: 10#L544-3true call cstrreplace_#t~mem2 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 5#L544-1true assume !!(0 != cstrreplace_#t~mem2);havoc cstrreplace_#t~mem2;call cstrreplace_#t~mem3 := read~int(cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1); 3#L545true assume cstrreplace_#t~mem3 == cstrreplace_~old;havoc cstrreplace_#t~mem3;call write~int(cstrreplace_~new, cstrreplace_~p~0.base, cstrreplace_~p~0.offset, 1);cstrreplace_#t~post4 := cstrreplace_~numReplaced~0;cstrreplace_~numReplaced~0 := 1 + cstrreplace_#t~post4;havoc cstrreplace_#t~post4; 6#L545-2true cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset := cstrreplace_~p~0.base, cstrreplace_~p~0.offset;cstrreplace_~p~0.base, cstrreplace_~p~0.offset := cstrreplace_#t~post5.base, 1 + cstrreplace_#t~post5.offset;havoc cstrreplace_#t~post5.base, cstrreplace_#t~post5.offset; 10#L544-3true [2019-01-02 00:21:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-02 00:21:07,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:07,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:07,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:07,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:07,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1359562, now seen corresponding path program 1 times [2019-01-02 00:21:08,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:08,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:08,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:08,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:08,036 INFO L82 PathProgramCache]: Analyzing trace with hash 176704686, now seen corresponding path program 1 times [2019-01-02 00:21:08,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:21:08,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:21:08,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:21:08,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:21:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:21:08,263 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-02 00:21:08,386 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-02 00:21:09,205 WARN L181 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-01-02 00:21:10,311 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 81 [2019-01-02 00:21:10,323 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:21:10,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:21:10,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:21:10,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:21:10,325 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:21:10,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:21:10,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:21:10,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:21:10,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:21:10,326 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:21:10,326 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:21:10,369 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:21:10,392 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:21:10,398 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:21:10,406 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:21:10,408 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:21:10,422 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:21:10,424 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:21:10,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-02 00:21:11,780 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-02 00:21:11,859 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:21:11,863 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:21:11,867 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:21:11,869 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:21:11,872 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:21:11,875 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:21:12,402 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-02 00:21:12,691 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-02 00:21:12,830 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-02 00:21:12,995 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:21:13,001 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:21:13,003 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:21:13,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,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:21:13,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,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:21:13,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,038 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:21:13,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,041 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:21:13,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,044 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:21:13,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:21:13,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:21:13,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:21:13,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,049 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:21:13,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:21:13,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,063 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:21:13,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,126 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:21:13,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,127 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:21:13,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,132 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:21:13,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:21:13,144 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:21:13,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:21:13,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:21:13,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:21:13,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:21:13,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:21:13,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:21:13,211 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:21:13,272 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:21:13,272 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:21:13,275 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:21:13,281 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:21:13,281 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:21:13,282 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1, ULTIMATE.start_cstrreplace_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0.offset Supporting invariants [] [2019-01-02 00:21:13,347 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:21:13,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:21:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:21:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:13,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:21:13,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:21:13,530 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:21:13,550 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:21:13,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-02 00:21:13,763 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 6 states. [2019-01-02 00:21:13,765 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:21:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:21:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-01-02 00:21:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-02 00:21:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:13,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-02 00:21:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:13,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-02 00:21:13,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:21:13,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-01-02 00:21:13,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:13,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-02 00:21:13,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:21:13,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:21:13,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:21:13,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:21:13,779 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:13,779 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:13,779 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:21:13,779 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:21:13,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:21:13,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:21:13,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:21:13,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:21:13 BoogieIcfgContainer [2019-01-02 00:21:13,785 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:21:13,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:21:13,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:21:13,786 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:21:13,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:21:07" (3/4) ... [2019-01-02 00:21:13,790 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:21:13,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:21:13,791 INFO L168 Benchmark]: Toolchain (without parser) took 7324.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -105.2 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:13,792 INFO L168 Benchmark]: CDTParser took 0.14 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:21:13,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:13,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:13,794 INFO L168 Benchmark]: Boogie Preprocessor took 48.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:21:13,795 INFO L168 Benchmark]: RCFGBuilder took 437.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:13,796 INFO L168 Benchmark]: BuchiAutomizer took 6057.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -11.0 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:21:13,797 INFO L168 Benchmark]: Witness Printer took 4.50 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:21:13,803 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 636.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 134.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 437.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6057.59 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -11.0 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.50 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 unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * p and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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: 8 SDtfs, 9 SDslu, 3 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital512 mio100 ax100 hnf98 lsp45 ukn168 mio100 lsp15 div141 bol100 ite100 ukn100 eq156 hnf70 smp81 dnf228 smp53 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 75ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...