./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-memory-alloca/openbsd_cstrcmp-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 c1eb142aa621a3b7c962754bdbb3857cadaf1720 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:13,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:13,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:13,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:13,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:13,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:13,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:13,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:13,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:13,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:13,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:13,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:13,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:13,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:13,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:13,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:13,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:13,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:13,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:13,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:13,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:13,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:13,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:13,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:13,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:13,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:13,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:13,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:13,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:13,351 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:13,352 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:13,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:13,352 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:13,353 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:13,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:13,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:13,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:13,371 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:13,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:13,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:13,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:13,373 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:13,373 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:13,374 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:13,374 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:13,374 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:13,374 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:13,374 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:13,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:13,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:13,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:13,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:13,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:13,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:13,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:13,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:13,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:13,377 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:13,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:13,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:13,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:13,378 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:13,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:13,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:13,379 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:13,380 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:13,380 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 -> c1eb142aa621a3b7c962754bdbb3857cadaf1720 [2018-11-28 23:21:13,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:13,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:13,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:13,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:13,435 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:13,436 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i [2018-11-28 23:21:13,493 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2865e71a4/376d17c4648d48d3a935d32ba93b74eb/FLAG0cbc293ad [2018-11-28 23:21:13,969 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:13,970 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrcmp-alloca_true-termination.c.i [2018-11-28 23:21:13,987 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2865e71a4/376d17c4648d48d3a935d32ba93b74eb/FLAG0cbc293ad [2018-11-28 23:21:14,294 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2865e71a4/376d17c4648d48d3a935d32ba93b74eb [2018-11-28 23:21:14,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:14,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:14,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:14,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:14,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:14,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3926fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14, skipping insertion in model container [2018-11-28 23:21:14,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:14,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:14,704 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:14,719 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:14,783 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:14,843 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:14,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14 WrapperNode [2018-11-28 23:21:14,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:14,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:14,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:14,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:14,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:14,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:14,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:14,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:14,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:14,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:15,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:15,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:15,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (1/1) ... [2018-11-28 23:21:15,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:15,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:15,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:15,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:15,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (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 [2018-11-28 23:21:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:15,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:15,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:15,459 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:15,459 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:21:15,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:15 BoogieIcfgContainer [2018-11-28 23:21:15,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:15,460 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:15,460 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:15,464 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:15,465 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:15,465 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:14" (1/3) ... [2018-11-28 23:21:15,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d50163a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:15, skipping insertion in model container [2018-11-28 23:21:15,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:15,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:14" (2/3) ... [2018-11-28 23:21:15,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d50163a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:15, skipping insertion in model container [2018-11-28 23:21:15,467 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:15,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:15" (3/3) ... [2018-11-28 23:21:15,469 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-termination.c.i [2018-11-28 23:21:15,528 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:15,528 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:15,529 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:15,529 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:15,529 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:15,529 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:15,529 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:15,530 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:15,530 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:15,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:21:15,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:15,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:15,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:15,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:15,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:15,577 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:15,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:21:15,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:15,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:15,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:15,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:15,580 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:15,589 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3#L558true assume !(main_~length1~0 < 1); 7#L558-2true assume !(main_~length2~0 < 1); 13#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset; 4#L550-3true [2018-11-28 23:21:15,589 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 15#L550-1true assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~mem4;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 11#L551true assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 4#L550-3true [2018-11-28 23:21:15,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:21:15,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:15,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:15,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:15,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 1 times [2018-11-28 23:21:15,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:15,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:15,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:15,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-11-28 23:21:15,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:15,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:16,340 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-28 23:21:17,247 WARN L180 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-28 23:21:17,362 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 23:21:17,373 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:17,374 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:17,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:17,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:17,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:17,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:17,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:17,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:17,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:21:17,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:17,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:17,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:17,982 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-28 23:21:18,176 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 23:21:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:18,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:18,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:18,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:18,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:18,443 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:21:19,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:19,120 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:19,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:19,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:19,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:19,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:19,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:19,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:19,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,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 [2018-11-28 23:21:19,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:19,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:19,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:19,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:19,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:19,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:19,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:19,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:19,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:19,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:19,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:19,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:19,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:19,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:19,470 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:19,470 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:21:19,473 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:19,474 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:19,475 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:19,475 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcmp_~s1.offset Supporting invariants [] [2018-11-28 23:21:19,675 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:21:19,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:19,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:19,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:19,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:19,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:21:19,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-28 23:21:20,017 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 26 states and 31 transitions. Complement of second has 8 states. [2018-11-28 23:21:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:21:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 23:21:20,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:21:20,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:20,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-28 23:21:20,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:20,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 23:21:20,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:20,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-28 23:21:20,030 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:20,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-28 23:21:20,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:21:20,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:21:20,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:21:20,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:20,036 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:20,036 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:20,036 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:20,036 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:20,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:21:20,036 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:20,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:21:20,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:21:20 BoogieIcfgContainer [2018-11-28 23:21:20,043 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:21:20,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:21:20,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:21:20,044 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:21:20,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:15" (3/4) ... [2018-11-28 23:21:20,048 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:21:20,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:21:20,050 INFO L168 Benchmark]: Toolchain (without parser) took 5751.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:20,051 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-11-28 23:21:20,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.26 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:20,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:20,053 INFO L168 Benchmark]: Boogie Preprocessor took 36.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:21:20,054 INFO L168 Benchmark]: RCFGBuilder took 444.75 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:20,055 INFO L168 Benchmark]: BuchiAutomizer took 4583.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.1 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:20,056 INFO L168 Benchmark]: Witness Printer took 4.91 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 23:21:20,061 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.18 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 544.26 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.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 132.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.70 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 444.75 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4583.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.1 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 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: 24 B). Peak memory consumption was 24 B. 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 * s1 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. 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: 10 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 9 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax108 hnf99 lsp89 ukn86 mio100 lsp48 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...