./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.05-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.05-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer --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 5313d851fadec6c1d632e24c5024506d6d98176e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 00:37:49,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:37:49,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:37:49,645 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:37:49,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:37:49,646 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:37:49,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:37:49,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:37:49,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:37:49,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:37:49,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:37:49,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:37:49,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:37:49,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:37:49,653 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:37:49,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:37:49,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:37:49,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:37:49,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:37:49,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:37:49,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:37:49,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:37:49,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:37:49,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:37:49,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:37:49,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:37:49,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:37:49,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:37:49,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:37:49,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:37:49,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:37:49,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:37:49,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:37:49,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:37:49,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:37:49,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:37:49,666 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 00:37:49,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:37:49,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:37:49,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:37:49,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:37:49,676 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:37:49,676 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:37:49,676 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:37:49,676 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:37:49,676 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:37:49,676 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:37:49,676 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:37:49,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:37:49,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:37:49,678 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:37:49,678 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:37:49,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:37:49,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:37:49,678 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:37:49,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:37:49,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:37:49,678 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:37:49,679 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:37:49,679 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer 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 -> 5313d851fadec6c1d632e24c5024506d6d98176e [2018-11-10 00:37:49,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:37:49,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:37:49,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:37:49,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:37:49,716 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:37:49,716 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.05-alloca_true-termination_true-no-overflow.c.i [2018-11-10 00:37:49,756 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/data/0978c476d/979a3c2f89064399acda1ef85be3a317/FLAG89770cce3 [2018-11-10 00:37:50,116 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:37:50,117 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/sv-benchmarks/c/termination-memory-alloca/a.05-alloca_true-termination_true-no-overflow.c.i [2018-11-10 00:37:50,123 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/data/0978c476d/979a3c2f89064399acda1ef85be3a317/FLAG89770cce3 [2018-11-10 00:37:50,134 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/data/0978c476d/979a3c2f89064399acda1ef85be3a317 [2018-11-10 00:37:50,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:37:50,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:37:50,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:37:50,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:37:50,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:37:50,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4205049b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50, skipping insertion in model container [2018-11-10 00:37:50,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:37:50,177 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:37:50,353 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:37:50,359 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:37:50,388 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:37:50,413 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:37:50,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50 WrapperNode [2018-11-10 00:37:50,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:37:50,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:37:50,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:37:50,414 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:37:50,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:37:50,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:37:50,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:37:50,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:37:50,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... [2018-11-10 00:37:50,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:37:50,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:37:50,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:37:50,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:37:50,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3859123-4831-410c-bb41-57fe3d005ed7/bin-2019/uautomizer/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-10 00:37:50,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 00:37:50,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 00:37:50,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:37:50,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:37:50,795 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:37:50,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:37:50 BoogieIcfgContainer [2018-11-10 00:37:50,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:37:50,796 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:37:50,796 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:37:50,798 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:37:50,799 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:37:50,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:37:50" (1/3) ... [2018-11-10 00:37:50,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f11b1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:37:50, skipping insertion in model container [2018-11-10 00:37:50,800 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:37:50,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:50" (2/3) ... [2018-11-10 00:37:50,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f11b1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:37:50, skipping insertion in model container [2018-11-10 00:37:50,800 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:37:50,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:37:50" (3/3) ... [2018-11-10 00:37:50,802 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.05-alloca_true-termination_true-no-overflow.c.i [2018-11-10 00:37:50,852 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:37:50,852 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:37:50,853 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:37:50,853 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:37:50,853 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:37:50,853 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:37:50,853 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:37:50,853 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:37:50,853 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:37:50,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 00:37:50,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 00:37:50,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:37:50,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:37:50,890 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:37:50,890 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:37:50,890 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:37:50,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 00:37:50,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 00:37:50,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:37:50,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:37:50,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:37:50,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:37:50,900 INFO L793 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 17#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 19#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 14#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6#L555-9true [2018-11-10 00:37:50,901 INFO L795 eck$LassoCheckResult]: Loop: 6#L555-9true assume true; 9#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555 11#L555-1true test_fun_#t~short8 := test_fun_#t~mem5 < 2147483647; 15#L555-2true assume !test_fun_#t~short8; 3#L555-7true assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 7#L556true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 10#L556-1true SUMMARY for call write~int(test_fun_#t~mem9 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 12#L556-2true havoc test_fun_#t~mem9; 6#L555-9true [2018-11-10 00:37:50,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:37:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 00:37:50,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:37:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:37:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:50,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:37:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:37:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1766603091, now seen corresponding path program 1 times [2018-11-10 00:37:51,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:37:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:37:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:37:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:37:51,080 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-10 00:37:51,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:37:51,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:37:51,085 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:37:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:37:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:37:51,096 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-11-10 00:37:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:37:51,126 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-10 00:37:51,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:37:51,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-10 00:37:51,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 00:37:51,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 16 states and 16 transitions. [2018-11-10 00:37:51,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-10 00:37:51,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-10 00:37:51,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 16 transitions. [2018-11-10 00:37:51,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:37:51,132 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-10 00:37:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 16 transitions. [2018-11-10 00:37:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 00:37:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 00:37:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-10 00:37:51,151 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-10 00:37:51,151 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-10 00:37:51,151 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:37:51,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 16 transitions. [2018-11-10 00:37:51,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 00:37:51,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:37:51,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:37:51,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 00:37:51,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:37:51,153 INFO L793 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~short8, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 63#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 67#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 64#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 56#L555-9 [2018-11-10 00:37:51,153 INFO L795 eck$LassoCheckResult]: Loop: 56#L555-9 assume true; 57#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555 59#L555-1 test_fun_#t~short8 := test_fun_#t~mem5 < 2147483647; 61#L555-2 assume test_fun_#t~short8; 65#L555-3 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-3 68#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 69#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 >= test_fun_#t~mem6 + 1; 54#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 55#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 58#L556-1 SUMMARY for call write~int(test_fun_#t~mem9 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556-1 60#L556-2 havoc test_fun_#t~mem9; 56#L555-9 [2018-11-10 00:37:51,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:37:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 00:37:51,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:37:51,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:37:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:37:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:37:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash 951752653, now seen corresponding path program 1 times [2018-11-10 00:37:51,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:37:51,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:37:51,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:37:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:37:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1148758355, now seen corresponding path program 1 times [2018-11-10 00:37:51,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:37:51,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:37:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:37:51,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:37:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:37:51,360 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-10 00:37:51,618 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 00:37:51,742 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-10 00:37:51,769 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:37:51,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:37:51,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:37:51,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:37:51,771 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:37:51,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:37:51,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:37:51,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:37:51,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.05-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 00:37:51,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:37:51,772 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:37:51,794 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-10 00:37:51,800 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-10 00:37:51,801 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-10 00:37:51,804 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-10 00:37:51,806 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-10 00:37:52,156 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 00:37:52,241 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-10 00:37:52,242 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-10 00:37:52,244 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-10 00:37:52,245 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-10 00:37:52,246 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-10 00:37:52,248 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-10 00:37:52,249 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-10 00:37:52,251 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-10 00:37:52,252 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-10 00:37:52,253 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-10 00:37:52,604 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:37:52,608 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:37:52,609 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-10 00:37:52,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:37:52,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:37:52,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:37:52,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,615 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-10 00:37:52,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:37:52,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:37:52,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:37:52,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,617 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-10 00:37:52,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:37:52,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:37:52,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,623 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-10 00:37:52,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:37:52,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:37:52,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:37:52,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,626 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-10 00:37:52,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:37:52,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:37:52,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,632 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-10 00:37:52,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:37:52,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:37:52,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,648 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-10 00:37:52,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:37:52,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:37:52,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:37:52,653 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-10 00:37:52,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:37:52,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:37:52,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:37:52,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:37:52,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:37:52,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 00:37:52,677 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 00:37:52,695 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 00:37:52,695 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 00:37:52,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 00:37:52,698 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 00:37:52,698 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 00:37:52,699 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-10 00:37:52,762 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 00:37:52,768 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 00:37:52,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:37:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:37:52,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:37:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:37:52,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 00:37:52,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 00:37:52,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 00:37:52,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 00:37:52,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:37:52,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:37:52,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 00:37:52,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 00:37:52,977 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-10 00:37:52,979 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 00:37:52,979 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 16 transitions. cyclomatic complexity: 1 Second operand 8 states. [2018-11-10 00:37:53,070 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 16 transitions. cyclomatic complexity: 1. Second operand 8 states. Result 28 states and 29 transitions. Complement of second has 14 states. [2018-11-10 00:37:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 00:37:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 00:37:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-10 00:37:53,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 5 letters. Loop has 11 letters. [2018-11-10 00:37:53,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:37:53,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 16 letters. Loop has 11 letters. [2018-11-10 00:37:53,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:37:53,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-10 00:37:53,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 00:37:53,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-10 00:37:53,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:37:53,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-10 00:37:53,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 00:37:53,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 00:37:53,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 00:37:53,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:37:53,075 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:37:53,076 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:37:53,076 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 00:37:53,076 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:37:53,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 00:37:53,076 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 00:37:53,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 00:37:53,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:37:53 BoogieIcfgContainer [2018-11-10 00:37:53,080 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:37:53,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:37:53,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:37:53,080 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:37:53,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:37:50" (3/4) ... [2018-11-10 00:37:53,084 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 00:37:53,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:37:53,085 INFO L168 Benchmark]: Toolchain (without parser) took 2947.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 956.6 MB in the beginning and 940.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 148.6 MB. Max. memory is 11.5 GB. [2018-11-10 00:37:53,086 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:37:53,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.90 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 00:37:53,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:37:53,087 INFO L168 Benchmark]: Boogie Preprocessor took 15.77 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-10 00:37:53,087 INFO L168 Benchmark]: RCFGBuilder took 285.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:37:53,088 INFO L168 Benchmark]: BuchiAutomizer took 2284.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.6 MB in the end (delta: 168.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. [2018-11-10 00:37:53,088 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:37:53,091 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.90 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 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 79.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.77 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 285.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2284.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 940.6 MB in the end (delta: 168.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 940.6 MB. 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 #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 4294967293 and consists of 8 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 24 SDslu, 28 SDs, 0 SdLazy, 28 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital258 mio100 ax106 hnf100 lsp91 ukn84 mio100 lsp37 div100 bol100 ite100 ukn100 eq195 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms 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...