./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ca73807de0c8f7d87fbb77e097710eeb5024a6fe .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:45:49,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:45:49,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:45:49,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:45:49,061 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:45:49,062 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:45:49,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:45:49,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:45:49,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:45:49,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:45:49,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:45:49,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:45:49,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:45:49,073 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:45:49,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:45:49,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:45:49,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:45:49,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:45:49,081 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:45:49,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:45:49,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:45:49,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:45:49,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:45:49,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:45:49,089 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:45:49,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:45:49,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:45:49,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:45:49,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:45:49,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:45:49,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:45:49,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:45:49,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:45:49,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:45:49,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:45:49,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:45:49,098 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:45:49,116 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:45:49,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:45:49,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:45:49,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:45:49,118 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:45:49,118 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:45:49,118 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:45:49,118 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:45:49,119 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:45:49,119 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:45:49,119 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:45:49,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:45:49,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:45:49,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:45:49,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:45:49,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:45:49,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:45:49,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:45:49,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:45:49,121 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:45:49,121 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:45:49,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:45:49,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:45:49,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:45:49,122 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:45:49,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:45:49,122 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:45:49,122 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:45:49,123 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:45:49,123 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca73807de0c8f7d87fbb77e097710eeb5024a6fe [2019-01-14 02:45:49,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:45:49,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:45:49,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:45:49,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:45:49,179 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:45:49,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i [2019-01-14 02:45:49,246 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad94960db/f7c2f4c188ca44169d43a07cd218a7e2/FLAG3386aa99f [2019-01-14 02:45:49,775 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:45:49,776 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i [2019-01-14 02:45:49,791 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad94960db/f7c2f4c188ca44169d43a07cd218a7e2/FLAG3386aa99f [2019-01-14 02:45:50,033 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad94960db/f7c2f4c188ca44169d43a07cd218a7e2 [2019-01-14 02:45:50,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:45:50,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:45:50,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:45:50,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:45:50,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:45:50,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f9e998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50, skipping insertion in model container [2019-01-14 02:45:50,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:45:50,093 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:45:50,509 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:45:50,524 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:45:50,608 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:45:50,680 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:45:50,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50 WrapperNode [2019-01-14 02:45:50,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:45:50,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:45:50,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:45:50,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:45:50,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:45:50,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:45:50,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:45:50,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:45:50,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (1/1) ... [2019-01-14 02:45:50,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:45:50,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:45:50,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:45:50,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:45:50,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (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-14 02:45:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:45:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:45:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:45:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:45:50,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:45:50,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:45:51,240 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:45:51,241 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:45:51,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:51 BoogieIcfgContainer [2019-01-14 02:45:51,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:45:51,244 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:45:51,245 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:45:51,248 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:45:51,249 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:51,250 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:45:50" (1/3) ... [2019-01-14 02:45:51,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9ac081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:45:51, skipping insertion in model container [2019-01-14 02:45:51,251 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:51,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:50" (2/3) ... [2019-01-14 02:45:51,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9ac081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:45:51, skipping insertion in model container [2019-01-14 02:45:51,252 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:51,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:51" (3/3) ... [2019-01-14 02:45:51,255 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcpy_diffterm_alloca_true-termination.c.i [2019-01-14 02:45:51,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:45:51,309 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:45:51,309 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:45:51,310 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:45:51,310 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:45:51,310 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:45:51,311 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:45:51,311 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:45:51,311 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:45:51,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:45:51,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:45:51,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:45:51,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:45:51,370 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:45:51,370 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:45:51,370 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:45:51,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:45:51,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:45:51,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:45:51,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:45:51,374 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:45:51,374 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:45:51,383 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet208, main_#t~nondet209, main_#t~malloc210.base, main_#t~malloc210.offset, main_#t~malloc211.base, main_#t~malloc211.offset, main_#t~ret212.base, main_#t~ret212.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet208;havoc main_#t~nondet208;main_~length2~0 := main_#t~nondet209;havoc main_#t~nondet209; 9#L375true assume !(main_~length1~0 < 1); 13#L375-2true assume !(main_~length2~0 < 1); 4#L378-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc210.base, main_#t~malloc210.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc210.base, main_#t~malloc210.offset;call main_#t~malloc211.base, main_#t~malloc211.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc211.base, main_#t~malloc211.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset, cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset, cstrcpy_#t~mem207, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 6#L368-3true [2019-01-14 02:45:51,384 INFO L796 eck$LassoCheckResult]: Loop: 6#L368-3true cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post205.base, 1 + cstrcpy_#t~post205.offset;cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post206.base, 1 + cstrcpy_#t~post206.offset;call cstrcpy_#t~mem207 := read~int(cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset, 1);call write~int(cstrcpy_#t~mem207, cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset, 1); 14#L368-1true assume !!(49 != cstrcpy_#t~mem207);havoc cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset;havoc cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset;havoc cstrcpy_#t~mem207; 6#L368-3true [2019-01-14 02:45:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-01-14 02:45:51,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:51,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:51,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 1 times [2019-01-14 02:45:51,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939599, now seen corresponding path program 1 times [2019-01-14 02:45:51,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:51,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:51,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:51,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:51,902 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 02:45:52,104 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-14 02:45:52,876 WARN L181 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-01-14 02:45:53,074 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-14 02:45:53,087 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:45:53,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:45:53,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:45:53,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:45:53,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:45:53,089 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:45:53,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:45:53,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:45:53,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:45:53,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:45:53,090 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:45:53,120 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-14 02:45:53,152 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-14 02:45:53,164 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-14 02:45:53,167 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-14 02:45:53,177 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-14 02:45:53,179 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-14 02:45:53,202 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-14 02:45:53,220 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-14 02:45:53,226 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-14 02:45:53,231 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-14 02:45:53,235 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-14 02:45:53,717 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-01-14 02:45:53,898 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-14 02:45:53,898 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-14 02:45:53,901 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-14 02:45:53,903 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-14 02:45:53,922 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-14 02:45:54,327 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:45:54,967 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:45:55,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:45:55,137 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:45:55,138 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-14 02:45:55,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,146 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-14 02:45:55,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,150 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-14 02:45:55,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,158 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-14 02:45:55,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,161 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-14 02:45:55,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,164 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-14 02:45:55,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,172 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-14 02:45:55,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,175 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-14 02:45:55,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,178 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-14 02:45:55,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,181 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-14 02:45:55,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:55,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,184 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-14 02:45:55,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,208 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-14 02:45:55,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,221 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-14 02:45:55,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,240 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-14 02:45:55,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,246 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-14 02:45:55,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:55,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,247 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:45:55,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,248 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:45:55,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:55,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,252 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-14 02:45:55,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,258 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-14 02:45:55,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,259 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:45:55,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,271 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:45:55,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:55,333 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-14 02:45:55,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:55,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:55,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:55,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:55,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:55,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:55,395 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:45:55,448 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:45:55,448 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:45:55,451 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:45:55,453 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:45:55,453 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:45:55,454 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcpy_~dst~0.base)_1, ULTIMATE.start_cstrcpy_~dst~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcpy_~dst~0.base)_1 - 1*ULTIMATE.start_cstrcpy_~dst~0.offset Supporting invariants [] [2019-01-14 02:45:55,643 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:45:55,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:45:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:45:55,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:45:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:45:55,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:45:55,790 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-14 02:45:55,804 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-14 02:45:55,805 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-01-14 02:45:55,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2019-01-14 02:45:55,842 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-14 02:45:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:45:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-14 02:45:55,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:45:55,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:55,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:45:55,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:55,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:45:55,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:55,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-01-14 02:45:55,852 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:45:55,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-14 02:45:55,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:45:55,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:45:55,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:45:55,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:45:55,856 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:55,856 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:55,856 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:55,856 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:45:55,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:45:55,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:45:55,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:45:55,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:45:55 BoogieIcfgContainer [2019-01-14 02:45:55,862 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:45:55,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:45:55,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:45:55,863 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:45:55,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:51" (3/4) ... [2019-01-14 02:45:55,867 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:45:55,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:45:55,867 INFO L168 Benchmark]: Toolchain (without parser) took 5830.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 78.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:55,868 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:45:55,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.29 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 923.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:55,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 923.2 MB in the beginning and 1.1 GB in the end (delta: -210.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:55,871 INFO L168 Benchmark]: Boogie Preprocessor took 28.54 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-14 02:45:55,871 INFO L168 Benchmark]: RCFGBuilder took 406.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:55,872 INFO L168 Benchmark]: BuchiAutomizer took 4618.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.8 MB). Peak memory consumption was 99.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:55,873 INFO L168 Benchmark]: Witness Printer took 3.88 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-14 02:45:55,879 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.29 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 923.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 124.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 923.2 MB in the beginning and 1.1 GB in the end (delta: -210.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 406.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4618.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.8 MB). Peak memory consumption was 99.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 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[dst] + -1 * dst and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: 16 SDtfs, 15 SDslu, 6 SDs, 0 SdLazy, 1 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf99 lsp97 ukn92 mio100 lsp46 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf188 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 74ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...