./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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/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-91b1670 [2018-11-28 23:18:26,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:26,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:26,869 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:26,869 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:26,870 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:26,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:26,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:26,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:26,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:26,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:26,878 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:26,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:26,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:26,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:26,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:26,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:26,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:26,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:26,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:26,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:26,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:26,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:26,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:26,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:26,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:26,899 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:26,900 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:26,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:26,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:26,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:26,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:26,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:26,904 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:26,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:26,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:26,907 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:26,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:26,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:26,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:26,927 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:26,927 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:26,927 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:26,927 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:26,927 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:26,927 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:26,928 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:26,928 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:26,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:26,928 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:26,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:26,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:26,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:26,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:26,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:26,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:26,931 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:26,931 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:26,931 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:26,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:26,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:26,932 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:26,932 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:26,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:26,933 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:26,935 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:26,935 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 [2018-11-28 23:18:26,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:26,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:26,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:26,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:26,995 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:26,996 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 [2018-11-28 23:18:27,060 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455276002/f57106a59f39407ea6ae77f499c18d77/FLAG6c3689f0a [2018-11-28 23:18:27,620 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:27,621 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-28 23:18:27,637 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455276002/f57106a59f39407ea6ae77f499c18d77/FLAG6c3689f0a [2018-11-28 23:18:27,895 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455276002/f57106a59f39407ea6ae77f499c18d77 [2018-11-28 23:18:27,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:27,900 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:27,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:27,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:27,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:27,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:27" (1/1) ... [2018-11-28 23:18:27,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460492eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:27, skipping insertion in model container [2018-11-28 23:18:27,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:27" (1/1) ... [2018-11-28 23:18:27,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:27,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:28,330 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:28,356 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:28,439 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:28,497 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:28,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28 WrapperNode [2018-11-28 23:18:28,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:28,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:28,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:28,499 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:28,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:28,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:28,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:28,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:28,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... [2018-11-28 23:18:28,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:28,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:28,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:28,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:28,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:29,142 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:29,142 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:18:29,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:29 BoogieIcfgContainer [2018-11-28 23:18:29,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:29,144 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:29,144 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:29,148 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:29,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:29,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:27" (1/3) ... [2018-11-28 23:18:29,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52391a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:29, skipping insertion in model container [2018-11-28 23:18:29,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:29,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:28" (2/3) ... [2018-11-28 23:18:29,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52391a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:29, skipping insertion in model container [2018-11-28 23:18:29,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:29,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:29" (3/3) ... [2018-11-28 23:18:29,153 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-11-28 23:18:29,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:29,217 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:29,217 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:29,217 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:29,218 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:29,218 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:29,218 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:29,218 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:29,218 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:29,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:18:29,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:29,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:29,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:29,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:29,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:29,264 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:29,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:18:29,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:29,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:29,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:29,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:18:29,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:29,276 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.alloc(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.alloc(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.alloc(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 [2018-11-28 23:18:29,276 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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:29,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:18:29,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:29,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:29,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:29,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:29,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:29,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:29,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-11-28 23:18:29,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:29,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:29,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:29,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:29,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:29,521 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-11-28 23:18:29,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:29,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:30,405 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 23:18:30,595 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-28 23:18:31,299 WARN L180 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-11-28 23:18:31,418 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:31,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:31,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:31,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:31,420 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:31,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:31,421 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:31,421 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:31,422 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:31,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:31,422 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:31,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:31,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:32,123 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-28 23:18:32,325 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-11-28 23:18:32,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:32,809 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-28 23:18:33,354 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:33,362 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:33,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:33,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:33,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:33,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,574 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:33,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:33,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,608 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:33,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,612 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:33,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,661 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:33,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,664 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:33,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:33,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:33,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:33,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:33,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:33,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:33,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:33,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:33,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:33,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:33,881 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:33,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:33,886 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:33,892 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:33,894 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 [] [2018-11-28 23:18:34,317 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:18:34,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:34,329 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:34,329 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:34,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:34,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:34,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:34,587 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:18:34,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-28 23:18:34,756 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. [2018-11-28 23:18:34,757 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 [2018-11-28 23:18:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-11-28 23:18:34,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:18:34,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:34,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:18:34,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:34,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 23:18:34,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:34,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-11-28 23:18:34,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:34,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2018-11-28 23:18:34,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:18:34,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:34,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-11-28 23:18:34,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:34,775 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 23:18:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-11-28 23:18:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 23:18:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:18:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-28 23:18:34,804 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 23:18:34,804 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 23:18:34,804 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:34,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-11-28 23:18:34,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:34,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:34,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:34,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:34,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:34,807 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.alloc(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.alloc(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.alloc(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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:34,807 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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:34,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:34,807 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2018-11-28 23:18:34,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:34,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:34,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:34,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:34,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:34,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:34,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:18:34,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:18:34,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-11-28 23:18:34,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:35,640 WARN L180 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 23:18:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:18:35,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:18:35,777 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 23:18:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:35,793 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-11-28 23:18:35,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:18:35,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-11-28 23:18:35,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:35,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2018-11-28 23:18:35,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:18:35,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:35,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-11-28 23:18:35,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:35,799 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 23:18:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-11-28 23:18:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 23:18:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:18:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-11-28 23:18:35,801 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 23:18:35,802 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-11-28 23:18:35,802 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:35,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-11-28 23:18:35,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:35,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:35,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:35,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:35,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:35,804 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.alloc(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.alloc(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.alloc(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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:35,805 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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:35,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:35,805 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2018-11-28 23:18:35,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:35,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:35,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:35,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:35,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:35,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:35,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:18:35,853 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:18:35,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-11-28 23:18:35,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:35,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:35,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:36,293 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 23:18:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:18:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:18:36,371 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 23:18:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:36,419 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-28 23:18:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:18:36,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-11-28 23:18:36,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:36,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-11-28 23:18:36,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:18:36,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:36,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-28 23:18:36,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:36,426 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:18:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-28 23:18:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-28 23:18:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:18:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-28 23:18:36,429 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:18:36,429 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-28 23:18:36,429 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:36,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-28 23:18:36,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:36,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:36,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:36,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:36,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:36,432 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.alloc(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.alloc(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.alloc(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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:36,432 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~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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~mem14;havoc main_#t~mem13;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 [2018-11-28 23:18:36,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-11-28 23:18:36,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:36,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:36,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:36,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2018-11-28 23:18:36,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:36,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:36,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:36,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-11-28 23:18:36,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:36,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:36,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:36,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:18:36,707 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 [2018-11-28 23:18:36,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:36,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:36,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:18:36,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:36,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:36,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-28 23:18:36,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:36,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 [2018-11-28 23:18:36,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:37,001 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 [2018-11-28 23:18:37,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,066 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 29 treesize of output 22 [2018-11-28 23:18:37,081 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 [2018-11-28 23:18:37,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,234 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-28 23:18:37,238 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 10 treesize of output 9 [2018-11-28 23:18:37,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,292 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:18 [2018-11-28 23:18:37,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 23:18:37,324 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 23:18:37,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,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 13 treesize of output 9 [2018-11-28 23:18:37,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:37,355 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-11-28 23:18:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:18:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-28 23:18:37,678 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-11-28 23:18:37,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:18:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:18:37,793 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-11-28 23:18:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:37,878 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-28 23:18:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:18:37,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-28 23:18:37,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:37,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-11-28 23:18:37,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:18:37,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:18:37,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-28 23:18:37,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:37,881 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-28 23:18:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-28 23:18:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-28 23:18:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:18:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:18:37,884 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:18:37,884 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:18:37,884 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:18:37,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-28 23:18:37,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:37,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:37,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:37,889 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:37,889 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:37,889 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 407#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.alloc(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.alloc(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.alloc(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; 408#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-11-28 23:18:37,889 INFO L796 eck$LassoCheckResult]: Loop: 409#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; 410#L554-3 main_#t~short12 := main_#t~short10; 416#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; 403#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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); 404#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 409#L554-1 [2018-11-28 23:18:37,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:18:37,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2018-11-28 23:18:37,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2018-11-28 23:18:37,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:38,317 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-11-28 23:18:38,542 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:18:38,865 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 23:18:39,295 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-28 23:18:39,300 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:39,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:39,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:39,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:39,300 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:39,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:39,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:39,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:39,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:18:39,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:39,302 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:39,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:39,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:39,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:39,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:39,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:39,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,181 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-11-28 23:18:40,435 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-11-28 23:18:40,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:40,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:41,311 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-28 23:18:41,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:41,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:41,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 [2018-11-28 23:18:41,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:41,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:41,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:41,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:41,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:41,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:41,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,459 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:41,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,461 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:41,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,478 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:41,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:41,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:41,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:41,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:41,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:41,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:41,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:41,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:41,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:41,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:41,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:41,505 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:41,506 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:41,510 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:41,510 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:41,510 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 [] [2018-11-28 23:18:42,150 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:18:42,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:42,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:42,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:42,856 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 23:18:42,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:42,901 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 [2018-11-28 23:18:43,161 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-28 23:18:43,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:43,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:43,228 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 [2018-11-28 23:18:43,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:43,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:43,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:43,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 23:18:43,702 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 23:18:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:43,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:44,167 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-11-28 23:18:44,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:44,413 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 [2018-11-28 23:18:44,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:44,450 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 [2018-11-28 23:18:44,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:44,471 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 [2018-11-28 23:18:44,475 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 [2018-11-28 23:18:44,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:44,534 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 [2018-11-28 23:18:44,540 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 [2018-11-28 23:18:44,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:44,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:44,707 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 [2018-11-28 23:18:44,708 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 23:18:44,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:44,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:44,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:44,839 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. [2018-11-28 23:18:44,840 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 23:18:45,019 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-11-28 23:18:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:45,020 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 [2018-11-28 23:18:45,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-28 23:18:45,128 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. [2018-11-28 23:18:45,130 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 [2018-11-28 23:18:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-11-28 23:18:45,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:18:45,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:45,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:18:45,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:45,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-28 23:18:45,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:45,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-11-28 23:18:45,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:45,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2018-11-28 23:18:45,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:18:45,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:18:45,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-11-28 23:18:45,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:45,138 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-28 23:18:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-11-28 23:18:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-11-28 23:18:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:18:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 23:18:45,142 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:18:45,142 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:18:45,142 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:18:45,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-28 23:18:45,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:18:45,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:45,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:45,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:45,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:45,145 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#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.alloc(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.alloc(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.alloc(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; 620#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 621#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; 625#L554-3 main_#t~short12 := main_#t~short10; 628#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; 617#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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); 618#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem14;havoc main_#t~mem13;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; 622#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-11-28 23:18:45,145 INFO L796 eck$LassoCheckResult]: Loop: 623#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; 624#L554-3 main_#t~short12 := main_#t~short10; 627#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; 615#L554-6 assume !!main_#t~short12;havoc main_#t~short10;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~mem8;havoc main_#t~mem9;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); 616#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem14;havoc main_#t~mem13;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; 629#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-11-28 23:18:45,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-11-28 23:18:45,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:45,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:45,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:45,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-11-28 23:18:45,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:45,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:45,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:45,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2018-11-28 23:18:45,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:45,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:45,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:45,556 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-11-28 23:18:45,748 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:18:46,606 WARN L180 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 124 [2018-11-28 23:18:47,412 WARN L180 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 23:18:47,417 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:47,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:47,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:47,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:47,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:47,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:47,418 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:47,418 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:47,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:18:47,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:47,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:47,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:47,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:48,396 WARN L180 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-28 23:18:48,576 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-11-28 23:18:48,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:48,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:48,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:48,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:49,482 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-28 23:18:49,650 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-11-28 23:18:49,716 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:49,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:49,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:49,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:49,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:49,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,818 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:49,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,819 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:49,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:49,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:49,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:49,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:49,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:49,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:49,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:49,869 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:49,870 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:49,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:49,884 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:18:49,885 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:18:50,024 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:50,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:50,087 INFO L444 ModelExtractionUtils]: 33 out of 36 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:50,087 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:50,092 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:18:50,092 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:50,092 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 [] [2018-11-28 23:18:50,463 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:18:50,468 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:50,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:50,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:50,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:50,562 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 [2018-11-28 23:18:50,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:50,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:50,591 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 [2018-11-28 23:18:50,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:50,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:50,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:50,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 23:18:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:50,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:50,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:50,740 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 [2018-11-28 23:18:50,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:50,746 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 [2018-11-28 23:18:50,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:50,766 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 [2018-11-28 23:18:50,770 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 [2018-11-28 23:18:50,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:50,816 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 [2018-11-28 23:18:50,822 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 [2018-11-28 23:18:50,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:50,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:50,878 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 [2018-11-28 23:18:50,879 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 23:18:50,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:50,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:50,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:50,995 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. [2018-11-28 23:18:50,996 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 23:18:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:51,064 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 [2018-11-28 23:18:51,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 23:18:51,132 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. [2018-11-28 23:18:51,136 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 [2018-11-28 23:18:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 23:18:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:18:51,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:51,137 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:51,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:51,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:51,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:51,192 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 [2018-11-28 23:18:51,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:51,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:51,213 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 [2018-11-28 23:18:51,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:51,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:51,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:51,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 23:18:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:51,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:51,507 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-11-28 23:18:51,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:51,536 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 [2018-11-28 23:18:51,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:51,542 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 [2018-11-28 23:18:51,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:51,561 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 [2018-11-28 23:18:51,565 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 [2018-11-28 23:18:51,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:51,606 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 [2018-11-28 23:18:51,610 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 [2018-11-28 23:18:51,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:51,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:51,681 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 [2018-11-28 23:18:51,682 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-28 23:18:51,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:51,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:51,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:51,811 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. [2018-11-28 23:18:51,812 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 23:18:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:51,997 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 [2018-11-28 23:18:51,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 23:18:52,070 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. [2018-11-28 23:18:52,072 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 [2018-11-28 23:18:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 23:18:52,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:18:52,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:52,073 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:18:52,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:52,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:52,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:52,128 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 [2018-11-28 23:18:52,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:52,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:52,192 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 [2018-11-28 23:18:52,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:52,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:52,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:52,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-28 23:18:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:52,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:52,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:52,283 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 [2018-11-28 23:18:52,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:52,288 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 [2018-11-28 23:18:52,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:52,307 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 [2018-11-28 23:18:52,311 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 [2018-11-28 23:18:52,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:52,348 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 [2018-11-28 23:18:52,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:52,362 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 43 treesize of output 54 [2018-11-28 23:18:52,363 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 23:18:52,422 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 34 treesize of output 33 [2018-11-28 23:18:52,422 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:52,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:52,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:52,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:18:52,549 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. [2018-11-28 23:18:52,549 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-11-28 23:18:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:52,618 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 [2018-11-28 23:18:52,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 23:18:52,703 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. [2018-11-28 23:18:52,704 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 [2018-11-28 23:18:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:18:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-11-28 23:18:52,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:18:52,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:52,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 23:18:52,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:52,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-28 23:18:52,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:52,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-28 23:18:52,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:52,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-28 23:18:52,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:52,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:52,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:52,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:52,708 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:52,708 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:52,708 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:52,709 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:18:52,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:52,709 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:52,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:52,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:52 BoogieIcfgContainer [2018-11-28 23:18:52,716 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:52,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:52,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:52,717 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:52,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:29" (3/4) ... [2018-11-28 23:18:52,721 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:52,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:52,722 INFO L168 Benchmark]: Toolchain (without parser) took 24823.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 364.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -126.9 MB). Peak memory consumption was 238.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:52,723 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:52,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:52,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:52,725 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:52,725 INFO L168 Benchmark]: RCFGBuilder took 485.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:52,726 INFO L168 Benchmark]: BuchiAutomizer took 23572.66 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:52,727 INFO L168 Benchmark]: Witness Printer took 4.66 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:52,730 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 596.93 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 485.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23572.66 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.66 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 17.5s. Construction of modules took 0.3s. Büchi inclusion checks took 5.4s. 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, 46 SDslu, 46 SDs, 0 SdLazy, 136 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1016 mio100 ax103 hnf99 lsp64 ukn53 mio100 lsp30 div100 bol104 ite100 ukn100 eq171 hnf88 smp97 dnf220 smp66 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 224ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 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...