./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ec1e9b4474a625821a91c382460b2fed74a8091 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:49:41,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:49:41,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:49:41,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:49:41,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:49:41,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:49:41,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:49:41,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:49:41,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:49:41,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:49:41,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:49:41,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:49:41,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:49:41,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:49:41,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:49:41,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:49:41,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:49:41,691 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:49:41,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:49:41,695 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:49:41,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:49:41,701 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:49:41,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:49:41,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:49:41,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:49:41,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:49:41,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:49:41,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:49:41,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:49:41,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:49:41,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:49:41,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:49:41,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:49:41,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:49:41,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:49:41,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:49:41,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:49:41,755 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:49:41,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:49:41,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:49:41,758 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:49:41,759 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:49:41,759 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:49:41,759 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:49:41,759 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:49:41,759 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:49:41,760 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:49:41,760 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:49:41,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:49:41,760 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:49:41,760 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:49:41,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:49:41,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:49:41,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:49:41,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:49:41,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:49:41,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:49:41,763 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:49:41,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:49:41,766 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:49:41,767 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:49:41,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:49:41,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:49:41,767 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:49:41,767 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:49:41,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:49:41,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:49:41,769 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:49:41,770 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:49:41,770 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ec1e9b4474a625821a91c382460b2fed74a8091 [2019-01-14 02:49:41,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:49:41,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:49:41,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:49:41,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:49:41,863 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:49:41,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i [2019-01-14 02:49:41,917 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb91a2bd/d5589db0370f49c6a16a9f331a866453/FLAG75e7932d2 [2019-01-14 02:49:42,348 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:49:42,349 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i [2019-01-14 02:49:42,354 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb91a2bd/d5589db0370f49c6a16a9f331a866453/FLAG75e7932d2 [2019-01-14 02:49:42,739 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb91a2bd/d5589db0370f49c6a16a9f331a866453 [2019-01-14 02:49:42,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:49:42,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:49:42,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:42,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:49:42,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:49:42,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:42" (1/1) ... [2019-01-14 02:49:42,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d054271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:42, skipping insertion in model container [2019-01-14 02:49:42,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:42" (1/1) ... [2019-01-14 02:49:42,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:49:42,794 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:49:43,044 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:43,053 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:49:43,080 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:43,111 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:49:43,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43 WrapperNode [2019-01-14 02:49:43,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:43,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:43,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:49:43,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:49:43,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:43,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:49:43,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:49:43,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:49:43,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:49:43,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:49:43,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:49:43,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:49:43,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:49:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:49:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:49:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:49:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:49:43,739 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:49:43,739 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:49:43,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:43 BoogieIcfgContainer [2019-01-14 02:49:43,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:49:43,741 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:49:43,741 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:49:43,744 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:49:43,745 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:43,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:49:42" (1/3) ... [2019-01-14 02:49:43,746 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@573f1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:43, skipping insertion in model container [2019-01-14 02:49:43,746 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:43,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (2/3) ... [2019-01-14 02:49:43,747 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@573f1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:43, skipping insertion in model container [2019-01-14 02:49:43,747 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:43,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:43" (3/3) ... [2019-01-14 02:49:43,749 INFO L375 chiAutomizerObserver]: Analyzing ICFG standard_vararg_true-unreach-call_ground_true-termination.i [2019-01-14 02:49:43,816 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:49:43,817 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:49:43,817 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:49:43,817 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:49:43,817 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:49:43,817 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:49:43,818 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:49:43,818 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:49:43,818 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:49:43,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:49:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:49:43,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:43,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:43,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:43,866 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:49:43,866 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:49:43,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:49:43,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:49:43,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:43,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:43,870 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:43,870 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:49:43,877 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~post1, main_#t~mem0, main_#t~mem3, main_#t~post2, main_~#aa~0.base, main_~#aa~0.offset, main_~a~0, main_~x~0;call main_~#aa~0.base, main_~#aa~0.offset := #Ultimate.allocOnStack(400000);main_~a~0 := 0; 15#L6-3true [2019-01-14 02:49:43,877 INFO L796 eck$LassoCheckResult]: Loop: 15#L6-3true call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + 4 * main_~a~0, 4); 3#L6-1true assume !!(main_#t~mem0 >= 0);havoc main_#t~mem0;main_#t~post1 := main_~a~0;main_~a~0 := 1 + main_#t~post1;havoc main_#t~post1; 15#L6-3true [2019-01-14 02:49:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:49:43,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:43,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1190, now seen corresponding path program 1 times [2019-01-14 02:49:43,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:43,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:44,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:44,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:44,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-14 02:49:44,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:44,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:44,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:44,358 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:44,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:44,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:44,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:44,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:44,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:44,362 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:44,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:44,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: standard_vararg_true-unreach-call_ground_true-termination.i_Iteration1_Lasso [2019-01-14 02:49:44,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:44,363 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:44,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,659 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 02:49:44,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:45,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:45,012 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:45,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:45,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:45,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:45,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:45,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:45,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:45,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:45,072 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:45,105 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:49:45,106 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:49:45,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:45,110 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:45,112 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:45,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#aa~0.base)_1, ULTIMATE.start_main_~#aa~0.offset, ULTIMATE.start_main_~a~0) = 1*v_rep(select #length ULTIMATE.start_main_~#aa~0.base)_1 - 1*ULTIMATE.start_main_~#aa~0.offset - 4*ULTIMATE.start_main_~a~0 Supporting invariants [] [2019-01-14 02:49:45,138 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:49:45,145 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:49:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:45,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:45,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:45,409 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:49:45,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-14 02:49:45,625 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2019-01-14 02:49:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:49:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 02:49:45,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:49:45,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:45,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:49:45,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:45,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:49:45,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:45,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2019-01-14 02:49:45,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:49:45,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 11 states and 13 transitions. [2019-01-14 02:49:45,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:49:45,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:49:45,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-14 02:49:45,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:49:45,648 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:49:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-14 02:49:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:49:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:49:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-14 02:49:45,688 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:49:45,688 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-14 02:49:45,688 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:49:45,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2019-01-14 02:49:45,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:49:45,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:45,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:45,692 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:45,692 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:49:45,692 INFO L794 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 90#L-1 havoc main_#res;havoc main_#t~post1, main_#t~mem0, main_#t~mem3, main_#t~post2, main_~#aa~0.base, main_~#aa~0.offset, main_~a~0, main_~x~0;call main_~#aa~0.base, main_~#aa~0.offset := #Ultimate.allocOnStack(400000);main_~a~0 := 0; 91#L6-3 call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + 4 * main_~a~0, 4); 92#L6-1 assume !(main_#t~mem0 >= 0);havoc main_#t~mem0; 93#L6-4 havoc main_~x~0;main_~x~0 := 0; 97#L10-3 [2019-01-14 02:49:45,692 INFO L796 eck$LassoCheckResult]: Loop: 97#L10-3 assume !!(main_~x~0 < main_~a~0);call main_#t~mem3 := read~int(main_~#aa~0.base, main_~#aa~0.offset + 4 * main_~x~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem3 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 98#L2 assume !(0 == __VERIFIER_assert_~cond); 88#L2-3 havoc main_#t~mem3; 89#L10-2 main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 97#L10-3 [2019-01-14 02:49:45,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash 28695786, now seen corresponding path program 1 times [2019-01-14 02:49:45,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:45,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:45,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1669354, now seen corresponding path program 1 times [2019-01-14 02:49:45,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:45,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1213512019, now seen corresponding path program 1 times [2019-01-14 02:49:45,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:45,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:45,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:45,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:49:46,049 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-01-14 02:49:46,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:49:46,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:49:46,055 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:49:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:46,095 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-14 02:49:46,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:49:46,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-01-14 02:49:46,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:49:46,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 12 states and 13 transitions. [2019-01-14 02:49:46,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:49:46,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:49:46,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-01-14 02:49:46,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:49:46,101 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:49:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-01-14 02:49:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 02:49:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:49:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-14 02:49:46,103 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-14 02:49:46,103 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-14 02:49:46,103 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:49:46,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-01-14 02:49:46,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:49:46,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:46,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:46,105 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-01-14 02:49:46,105 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:49:46,105 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~post1, main_#t~mem0, main_#t~mem3, main_#t~post2, main_~#aa~0.base, main_~#aa~0.offset, main_~a~0, main_~x~0;call main_~#aa~0.base, main_~#aa~0.offset := #Ultimate.allocOnStack(400000);main_~a~0 := 0; 126#L6-3 call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + 4 * main_~a~0, 4); 129#L6-1 assume !!(main_#t~mem0 >= 0);havoc main_#t~mem0;main_#t~post1 := main_~a~0;main_~a~0 := 1 + main_#t~post1;havoc main_#t~post1; 130#L6-3 call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + 4 * main_~a~0, 4); 127#L6-1 assume !(main_#t~mem0 >= 0);havoc main_#t~mem0; 128#L6-4 havoc main_~x~0;main_~x~0 := 0; 132#L10-3 [2019-01-14 02:49:46,105 INFO L796 eck$LassoCheckResult]: Loop: 132#L10-3 assume !!(main_~x~0 < main_~a~0);call main_#t~mem3 := read~int(main_~#aa~0.base, main_~#aa~0.offset + 4 * main_~x~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem3 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 133#L2 assume !(0 == __VERIFIER_assert_~cond); 123#L2-3 havoc main_#t~mem3; 124#L10-2 main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 132#L10-3 [2019-01-14 02:49:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1806897829, now seen corresponding path program 1 times [2019-01-14 02:49:46,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:46,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1669354, now seen corresponding path program 2 times [2019-01-14 02:49:46,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:46,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:46,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:46,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1627036046, now seen corresponding path program 1 times [2019-01-14 02:49:46,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:46,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:46,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:46,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,559 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-01-14 02:49:46,609 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:46,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:46,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:46,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:46,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:46,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:46,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:46,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:46,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: standard_vararg_true-unreach-call_ground_true-termination.i_Iteration3_Lasso [2019-01-14 02:49:46,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:46,610 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:46,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:46,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:47,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:47,092 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:47,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:47,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:47,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:47,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:47,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:47,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:47,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:47,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:47,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:47,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:47,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:47,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:47,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:47,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:47,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:47,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:47,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:47,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:47,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:47,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:47,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:47,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:47,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:47,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:47,135 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:47,169 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:49:47,169 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:49:47,170 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:47,172 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:47,172 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:47,173 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0, ULTIMATE.start_main_~a~0) = -1*ULTIMATE.start_main_~x~0 + 1*ULTIMATE.start_main_~a~0 Supporting invariants [] [2019-01-14 02:49:47,213 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 02:49:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:47,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:47,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:47,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:49:47,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:49:47,409 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2019-01-14 02:49:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:49:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 02:49:47,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:49:47,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:47,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 4 letters. [2019-01-14 02:49:47,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:47,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 8 letters. [2019-01-14 02:49:47,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:47,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-14 02:49:47,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:47,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-14 02:49:47,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:47,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:47,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:47,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:47,414 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:47,414 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:47,414 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:47,414 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:49:47,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:49:47,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:47,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:49:47,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:49:47 BoogieIcfgContainer [2019-01-14 02:49:47,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:49:47,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:49:47,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:49:47,422 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:49:47,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:43" (3/4) ... [2019-01-14 02:49:47,426 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:49:47,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:49:47,427 INFO L168 Benchmark]: Toolchain (without parser) took 4679.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 946.0 MB in the beginning and 929.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:47,429 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:47,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.56 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:47,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.94 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:47,432 INFO L168 Benchmark]: Boogie Preprocessor took 45.61 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:47,433 INFO L168 Benchmark]: RCFGBuilder took 525.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:47,434 INFO L168 Benchmark]: BuchiAutomizer took 3680.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.5 MB in the end (delta: 199.0 MB). Peak memory consumption was 199.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:47,435 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 929.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:47,442 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.56 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.94 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.61 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 525.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3680.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.5 MB in the end (delta: 199.0 MB). Peak memory consumption was 199.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 929.5 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[aa] + -1 * aa + -4 * a and consists of 4 locations. One deterministic module has affine ranking function -1 * x + a and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 20 SDslu, 15 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital97 mio100 ax100 hnf100 lsp90 ukn65 mio100 lsp59 div100 bol100 ite100 ukn100 eq158 hnf91 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 98ms VariablesStem: 3 VariablesLoop: 4 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...