./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4ab4fc7901859c456c176827e7d5fcf9e4988b17 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26:02,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:26:02,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:26:02,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:26:02,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:26:02,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:26:02,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:26:02,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:26:02,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:26:02,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:26:02,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:26:02,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:26:02,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:26:02,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:26:02,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:26:02,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:26:02,719 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:26:02,721 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:26:02,722 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:26:02,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:26:02,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:26:02,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:26:02,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:26:02,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:26:02,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:26:02,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:26:02,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:26:02,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:26:02,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:26:02,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:26:02,746 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:26:02,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:26:02,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:26:02,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:26:02,749 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:26:02,751 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:26:02,752 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:26:02,779 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:26:02,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:26:02,782 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:26:02,782 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:26:02,782 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:26:02,782 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:26:02,782 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:26:02,782 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:26:02,783 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:26:02,783 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:26:02,784 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:26:02,784 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:26:02,784 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:26:02,784 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:26:02,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:26:02,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:26:02,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:26:02,786 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:26:02,786 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:26:02,786 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:26:02,786 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:26:02,786 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:26:02,786 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:26:02,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:26:02,787 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:26:02,787 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:26:02,787 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:26:02,787 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:26:02,789 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:26:02,789 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2019-01-14 02:26:02,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:26:02,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:26:02,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:26:02,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:26:02,845 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:26:02,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2019-01-14 02:26:02,902 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae57eea30/3dd32c16ab464c7391c534f1d7f562a4/FLAG5266007ad [2019-01-14 02:26:03,386 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:26:03,387 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2019-01-14 02:26:03,401 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae57eea30/3dd32c16ab464c7391c534f1d7f562a4/FLAG5266007ad [2019-01-14 02:26:03,692 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae57eea30/3dd32c16ab464c7391c534f1d7f562a4 [2019-01-14 02:26:03,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:26:03,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:26:03,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:03,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:26:03,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:26:03,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:03" (1/1) ... [2019-01-14 02:26:03,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6942e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:03, skipping insertion in model container [2019-01-14 02:26:03,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:26:03" (1/1) ... [2019-01-14 02:26:03,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:26:03,765 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:26:04,110 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:04,126 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:26:04,174 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:26:04,313 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:26:04,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04 WrapperNode [2019-01-14 02:26:04,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:26:04,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:04,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:26:04,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:26:04,322 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:26:04" (1/1) ... [2019-01-14 02:26:04,339 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:26:04" (1/1) ... [2019-01-14 02:26:04,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:26:04,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:26:04,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:26:04,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:26:04,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (1/1) ... [2019-01-14 02:26:04,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:26:04,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:26:04,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:26:04,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:26:04,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (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:26:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:26:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:26:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:26:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:26:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:26:04,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:26:04,847 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:26:04,848 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:26:04,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:04 BoogieIcfgContainer [2019-01-14 02:26:04,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:26:04,850 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:26:04,850 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:26:04,853 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:26:04,854 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:04,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:26:03" (1/3) ... [2019-01-14 02:26:04,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b59104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:04, skipping insertion in model container [2019-01-14 02:26:04,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:04,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:26:04" (2/3) ... [2019-01-14 02:26:04,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b59104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:26:04, skipping insertion in model container [2019-01-14 02:26:04,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:26:04,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:04" (3/3) ... [2019-01-14 02:26:04,858 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2019-01-14 02:26:04,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:26:04,912 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:26:04,912 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:26:04,913 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:26:04,913 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:26:04,913 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:26:04,913 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:26:04,913 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:26:04,913 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:26:04,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:26:04,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:04,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:04,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:04,954 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:04,955 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:04,955 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:26:04,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:26:04,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:04,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:04,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:04,957 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:26:04,958 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:04,964 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2019-01-14 02:26:04,965 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2019-01-14 02:26:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:26:04,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-01-14 02:26:05,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:05,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-01-14 02:26:05,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:05,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:06,050 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-14 02:26:06,897 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-01-14 02:26:07,035 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-14 02:26:07,048 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:07,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:07,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:07,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:07,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:07,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:07,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:07,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:07,051 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:26:07,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:07,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:07,076 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:26:07,085 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:26:07,089 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:26:07,091 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:26:07,627 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-01-14 02:26:07,815 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:26:07,815 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:26:07,818 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:26:07,821 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:26:07,826 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:26:07,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:26:07,836 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:26:07,838 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:26:07,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:26:07,845 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:26:07,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:26:07,877 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:26:07,879 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:26:07,882 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:26:07,887 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:26:07,891 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:26:07,905 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:26:07,906 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:26:07,925 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:26:08,298 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-14 02:26:08,985 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:09,129 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:26:09,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:09,319 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:09,322 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:26:09,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:09,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:09,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:09,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:09,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:09,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:09,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:09,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,338 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:26:09,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:09,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:09,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:09,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,343 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:26:09,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:09,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,365 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:26:09,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:09,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,383 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:26:09,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:09,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,393 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:26:09,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,394 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-14 02:26:09,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,408 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:26:09,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,469 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:26:09,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:09,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,508 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:26:09,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:09,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:09,532 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:26:09,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:09,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:09,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:09,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:09,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:09,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:09,570 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:09,596 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:26:09,599 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:09,602 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:09,604 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:09,605 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:09,606 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2019-01-14 02:26:10,051 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:10,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:10,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:10,061 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:10,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:10,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:10,272 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:26:10,288 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:26:10,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-01-14 02:26:10,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2019-01-14 02:26:10,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:26:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-14 02:26:10,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:26:10,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:10,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:26:10,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:10,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-14 02:26:10,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:10,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-01-14 02:26:10,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:10,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2019-01-14 02:26:10,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:26:10,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:26:10,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-01-14 02:26:10,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:10,560 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:26:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-01-14 02:26:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 02:26:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:26:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-14 02:26:10,591 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:26:10,591 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-14 02:26:10,591 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:26:10,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-14 02:26:10,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:10,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:10,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:10,593 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:10,593 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:10,594 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2019-01-14 02:26:10,594 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2019-01-14 02:26:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2019-01-14 02:26:10,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:10,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:10,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:10,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:10,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:10,703 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:26:10,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:26:10,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:26:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-01-14 02:26:10,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:10,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:10,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:11,046 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-14 02:26:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:26:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:26:11,100 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-14 02:26:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:11,113 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-01-14 02:26:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:26:11,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-01-14 02:26:11,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:11,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2019-01-14 02:26:11,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:26:11,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:26:11,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-01-14 02:26:11,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:11,118 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:26:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-01-14 02:26:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 02:26:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:26:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-01-14 02:26:11,121 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:26:11,121 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 02:26:11,121 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:26:11,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-01-14 02:26:11,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:11,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:11,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:11,124 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:11,124 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:11,125 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2019-01-14 02:26:11,125 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2019-01-14 02:26:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2019-01-14 02:26:11,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:11,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:11,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:11,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:11,222 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:26:11,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:26:11,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:26:11,223 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:26:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-01-14 02:26:11,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:11,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:11,876 WARN L181 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-14 02:26:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:26:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:26:11,945 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 02:26:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:11,969 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-01-14 02:26:11,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:26:11,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2019-01-14 02:26:11,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:11,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-01-14 02:26:11,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:26:11,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:26:11,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-14 02:26:11,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:11,975 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:26:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-14 02:26:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 02:26:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 02:26:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 02:26:11,978 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:26:11,978 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 02:26:11,978 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:26:11,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-14 02:26:11,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:11,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:11,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:11,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:11,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:11,981 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2019-01-14 02:26:11,981 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2019-01-14 02:26:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-01-14 02:26:11,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:11,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:11,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:11,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:11,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2019-01-14 02:26:12,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:12,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:12,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-01-14 02:26:12,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:12,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:12,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:12,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:12,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:26:12,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:26:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:12,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:12,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:12,959 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 52 [2019-01-14 02:26:12,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:12,967 INFO L478 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 23 treesize of output 16 [2019-01-14 02:26:12,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:12,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-14 02:26:12,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:12,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:13,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2019-01-14 02:26:13,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-01-14 02:26:13,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-14 02:26:13,104 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:13,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:13,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:13,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:13,163 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:92, output treesize:31 [2019-01-14 02:26:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:13,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:13,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2019-01-14 02:26:13,307 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2019-01-14 02:26:13,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 02:26:13,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 02:26:13,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 02:26:13,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-14 02:26:13,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:13,379 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:44, output treesize:3 [2019-01-14 02:26:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:26:13,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:26:13,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-14 02:26:13,655 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-01-14 02:26:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:26:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:26:13,714 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-01-14 02:26:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:26:13,897 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-01-14 02:26:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:26:13,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-01-14 02:26:13,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:13,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-01-14 02:26:13,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:26:13,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:26:13,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-01-14 02:26:13,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:13,900 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 02:26:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-01-14 02:26:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-14 02:26:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:26:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 02:26:13,903 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:26:13,903 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:26:13,904 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:26:13,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-14 02:26:13,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:13,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:13,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:13,905 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:26:13,905 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:13,905 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 412#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-01-14 02:26:13,905 INFO L796 eck$LassoCheckResult]: Loop: 414#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 417#L554-3 main_#t~short12 := main_#t~short10; 420#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 407#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 408#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-01-14 02:26:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:26:13,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:13,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:13,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:13,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:13,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:13,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2019-01-14 02:26:13,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:13,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:13,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:13,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:13,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:13,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2019-01-14 02:26:13,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:13,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:26:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:14,584 WARN L181 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-01-14 02:26:14,815 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:26:15,177 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-14 02:26:15,741 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-14 02:26:15,745 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:15,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:15,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:15,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:15,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:15,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:15,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:15,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:15,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:26:15,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:15,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:15,761 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:26:16,582 WARN L181 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-01-14 02:26:16,979 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-14 02:26:16,980 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:26:16,983 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:26:16,984 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:26:16,985 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:26:16,986 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:26:16,999 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:26:17,001 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:26:17,004 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:26:17,007 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:26:17,008 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:26:17,010 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:26:17,012 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:26:17,013 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:26:17,015 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:26:17,016 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:26:17,017 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:26:17,019 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:26:17,022 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:26:17,023 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:26:17,025 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:26:17,028 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:26:17,143 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-14 02:26:17,942 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:18,197 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-14 02:26:18,268 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:18,269 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:18,269 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:26:18,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:18,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:18,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:18,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:18,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:18,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:18,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:18,298 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:26:18,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:18,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:18,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:18,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:18,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:18,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:18,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:18,312 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:26:18,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:18,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:18,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:18,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:18,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:18,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:18,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:18,320 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:26:18,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:18,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:18,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:18,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:18,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:18,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:18,347 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:18,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:26:18,352 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:26:18,352 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:18,354 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:26:18,354 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:18,354 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-01-14 02:26:18,595 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:18,601 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:18,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:18,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:18,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:26:18,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:18,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:18,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:18,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:18,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:18,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:18,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:26:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:18,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:19,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:19,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-14 02:26:19,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:19,101 INFO L478 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 33 treesize of output 22 [2019-01-14 02:26:19,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:19,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 02:26:19,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:19,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:19,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 02:26:19,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-14 02:26:19,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:19,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:19,325 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-14 02:26:19,326 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 02:26:19,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:19,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:19,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:19,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:26:19,486 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-14 02:26:19,642 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2019-01-14 02:26:19,643 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:26:19,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:26:19,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-14 02:26:19,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2019-01-14 02:26:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:26:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-01-14 02:26:19,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:26:19,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:19,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:26:19,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:19,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2019-01-14 02:26:19,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:19,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-01-14 02:26:19,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:19,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2019-01-14 02:26:19,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:26:19,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:26:19,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-01-14 02:26:19,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:26:19,778 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 02:26:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-01-14 02:26:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-14 02:26:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:26:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-14 02:26:19,780 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-14 02:26:19,780 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-14 02:26:19,780 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:26:19,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-01-14 02:26:19,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:26:19,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:26:19,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:26:19,781 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:26:19,782 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:26:19,782 INFO L794 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 623#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 624#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 625#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 629#L554-3 main_#t~short12 := main_#t~short10; 632#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 621#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 622#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 626#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-01-14 02:26:19,785 INFO L796 eck$LassoCheckResult]: Loop: 627#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 628#L554-3 main_#t~short12 := main_#t~short10; 631#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 619#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 633#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-01-14 02:26:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-01-14 02:26:19,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:19,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:19,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-01-14 02:26:19,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:19,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:19,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2019-01-14 02:26:19,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:26:19,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:26:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:19,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:26:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:26:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:26:20,211 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-01-14 02:26:20,459 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-14 02:26:21,516 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-01-14 02:26:22,403 WARN L181 SmtUtils]: Spent 872.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-01-14 02:26:22,407 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:26:22,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:26:22,408 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:26:22,408 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:26:22,408 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:26:22,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:26:22,408 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:26:22,408 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:26:22,408 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-14 02:26:22,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:26:22,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:26:22,415 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:26:22,441 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:26:22,469 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:26:22,471 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:26:22,474 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:26:22,475 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:26:22,477 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:26:22,483 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:26:22,486 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:26:22,488 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:26:22,490 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:26:22,492 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:26:22,494 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:26:22,514 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:26:23,463 WARN L181 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-01-14 02:26:23,658 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-14 02:26:23,659 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:26:23,661 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:26:23,663 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:26:23,665 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:26:23,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:26:23,670 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:26:24,013 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-01-14 02:26:24,321 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-01-14 02:26:24,555 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-14 02:26:25,103 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-14 02:26:25,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:26:25,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:26:25,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:25,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,136 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:26:25,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:25,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:25,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:25,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,162 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:26:25,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,169 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:26:25,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,171 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:26:25,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:26:25,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,188 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:26:25,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,190 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:26:25,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,196 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:26:25,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,204 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:26:25,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:26:25,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:26:25,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:26:25,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,210 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:26:25,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,220 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:26:25,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,229 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:26:25,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,233 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:26:25,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:26:25,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:26:25,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:26:25,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:26:25,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:26:25,236 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:26:25,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:26:25,237 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:26:25,237 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:26:25,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:26:25,256 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:26:25,256 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:26:25,492 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:26:25,574 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:26:25,574 INFO L444 ModelExtractionUtils]: 29 out of 36 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:26:25,574 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:26:25,575 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:26:25,578 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:26:25,578 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2019-01-14 02:26:25,912 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-14 02:26:25,918 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:26:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:25,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:26:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:26,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:26:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:26,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-14 02:26:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,236 INFO L478 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 33 treesize of output 22 [2019-01-14 02:26:26,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 02:26:26,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:26,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 02:26:26,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-14 02:26:26,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,406 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-14 02:26:26,407 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 02:26:26,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:26,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:26,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:26,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:26:26,525 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-14 02:26:26,595 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:26:26,595 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:26:26,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-14 02:26:26,677 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-01-14 02:26:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:26:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:26:26,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:26:26,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:26,681 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:26:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:26,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:26:26,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:26,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:26,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:26:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:26,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-14 02:26:26,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:26,942 INFO L478 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 33 treesize of output 22 [2019-01-14 02:26:26,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 02:26:27,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:27,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 02:26:27,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-14 02:26:27,078 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:27,329 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-14 02:26:27,330 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 02:26:27,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:27,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:27,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:27,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:26:27,461 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-14 02:26:27,544 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:26:27,544 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:26:27,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-14 02:26:27,624 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-01-14 02:26:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:26:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:26:27,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:26:27,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:27,626 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:26:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:26:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:27,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:27,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:27,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:26:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:27,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:27,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:26:27,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-14 02:26:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:26:27,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:26:27,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:27,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2019-01-14 02:26:27,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:27,923 INFO L478 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 33 treesize of output 22 [2019-01-14 02:26:27,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 02:26:27,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:26:27,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:27,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2019-01-14 02:26:27,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2019-01-14 02:26:27,989 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:26:28,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:26:28,111 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2019-01-14 02:26:28,112 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-14 02:26:28,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:28,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:28,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:26:28,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:26:28,333 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2019-01-14 02:26:28,517 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:26:28,517 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-14 02:26:28,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-01-14 02:26:28,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2019-01-14 02:26:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:26:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:26:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-01-14 02:26:28,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-14 02:26:28,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:28,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:26:28,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:28,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-01-14 02:26:28,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:26:28,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-01-14 02:26:28,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:26:28,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-01-14 02:26:28,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:26:28,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:26:28,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:26:28,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:26:28,662 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:28,663 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:28,663 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:26:28,663 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:26:28,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:26:28,663 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:26:28,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:26:28,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:26:28 BoogieIcfgContainer [2019-01-14 02:26:28,674 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:26:28,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:26:28,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:26:28,674 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:26:28,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:26:04" (3/4) ... [2019-01-14 02:26:28,682 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:26:28,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:26:28,683 INFO L168 Benchmark]: Toolchain (without parser) took 24986.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -328.6 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:28,684 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:28,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:28,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.72 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:28,688 INFO L168 Benchmark]: Boogie Preprocessor took 25.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:28,689 INFO L168 Benchmark]: RCFGBuilder took 462.81 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:28,689 INFO L168 Benchmark]: BuchiAutomizer took 23824.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -166.0 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:26:28,690 INFO L168 Benchmark]: Witness Printer took 7.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:26:28,696 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 615.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -193.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.72 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.81 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 462.81 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.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23824.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -166.0 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 18.9s. Construction of modules took 0.4s. Büchi inclusion checks took 4.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 55 SDslu, 45 SDs, 0 SdLazy, 134 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1031 mio100 ax103 hnf99 lsp64 ukn56 mio100 lsp28 div100 bol104 ite100 ukn100 eq174 hnf88 smp97 dnf301 smp90 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 76ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...