./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/min_rf-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 e3ac7e4caefab280af1b902717cbfa5c070462d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:51:06,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:51:06,756 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:51:06,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:51:06,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:51:06,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:51:06,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:51:06,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:51:06,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:51:06,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:51:06,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:51:06,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:51:06,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:51:06,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:51:06,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:51:06,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:51:06,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:51:06,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:51:06,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:51:06,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:51:06,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:51:06,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:51:06,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:51:06,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:51:06,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:51:06,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:51:06,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:51:06,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:51:06,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:51:06,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:51:06,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:51:06,837 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:51:06,837 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:51:06,837 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:51:06,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:51:06,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:51:06,841 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:51:06,867 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:51:06,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:51:06,869 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:51:06,869 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:51:06,869 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:51:06,869 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:51:06,869 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:51:06,870 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:51:06,870 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:51:06,870 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:51:06,870 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:51:06,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:51:06,870 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:51:06,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:51:06,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:51:06,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:51:06,871 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:51:06,871 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:51:06,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:51:06,872 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:51:06,872 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:51:06,872 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:51:06,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:51:06,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:51:06,872 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:51:06,873 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:51:06,873 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:51:06,873 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:51:06,874 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:51:06,874 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 -> e3ac7e4caefab280af1b902717cbfa5c070462d8 [2019-01-01 21:51:06,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:51:06,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:51:06,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:51:06,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:51:06,948 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:51:06,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2019-01-01 21:51:07,019 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c175dd5c3/6a474e04d01c4266847fc7dbee67c140/FLAGbb75c52ba [2019-01-01 21:51:07,538 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:51:07,539 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2019-01-01 21:51:07,555 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c175dd5c3/6a474e04d01c4266847fc7dbee67c140/FLAGbb75c52ba [2019-01-01 21:51:07,819 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c175dd5c3/6a474e04d01c4266847fc7dbee67c140 [2019-01-01 21:51:07,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:51:07,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:51:07,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:51:07,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:51:07,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:51:07,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:51:07" (1/1) ... [2019-01-01 21:51:07,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5801be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:07, skipping insertion in model container [2019-01-01 21:51:07,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:51:07" (1/1) ... [2019-01-01 21:51:07,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:51:07,905 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:51:08,266 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:51:08,278 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:51:08,337 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:51:08,478 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:51:08,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08 WrapperNode [2019-01-01 21:51:08,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:51:08,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:51:08,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:51:08,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:51:08,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:51:08,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:51:08,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:51:08,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:51:08,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... [2019-01-01 21:51:08,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:51:08,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:51:08,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:51:08,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:51:08,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:51:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:51:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:51:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:51:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:51:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:51:09,091 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:51:09,092 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:51:09,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:51:09 BoogieIcfgContainer [2019-01-01 21:51:09,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:51:09,093 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:51:09,093 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:51:09,097 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:51:09,098 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:51:09,099 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:51:07" (1/3) ... [2019-01-01 21:51:09,100 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@526b1161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:51:09, skipping insertion in model container [2019-01-01 21:51:09,100 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:51:09,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:51:08" (2/3) ... [2019-01-01 21:51:09,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@526b1161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:51:09, skipping insertion in model container [2019-01-01 21:51:09,101 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:51:09,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:51:09" (3/3) ... [2019-01-01 21:51:09,103 INFO L375 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca_true-termination.c.i [2019-01-01 21:51:09,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:51:09,166 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:51:09,166 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:51:09,166 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:51:09,166 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:51:09,167 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:51:09,167 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:51:09,167 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:51:09,167 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:51:09,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:51:09,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:51:09,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:09,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:09,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:51:09,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:09,222 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:51:09,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:51:09,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:51:09,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:09,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:09,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:51:09,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:09,234 INFO L794 eck$LassoCheckResult]: Stem: 5#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 11#L556-1true [2019-01-01 21:51:09,235 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-1true call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 7#L553-1true assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L553-3true assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 13#L554true assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 8#L554-2true assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 11#L556-1true [2019-01-01 21:51:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:51:09,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:09,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:09,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:09,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 1 times [2019-01-01 21:51:09,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:09,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:09,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:09,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849170, now seen corresponding path program 1 times [2019-01-01 21:51:09,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:09,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:09,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:09,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:10,344 WARN L181 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-01 21:51:10,510 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:51:11,155 WARN L181 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-01 21:51:11,272 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-01-01 21:51:11,289 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:11,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:11,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:11,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:11,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:11,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:11,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:11,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:11,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:51:11,292 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:11,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:11,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:11,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:12,002 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-01 21:51:12,212 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:51:12,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:12,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:12,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:12,490 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-01 21:51:13,686 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:51:13,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:13,735 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:13,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,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 [2019-01-01 21:51:13,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,821 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:51:13,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:51:13,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,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 [2019-01-01 21:51:13,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:13,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:13,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:13,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:13,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:13,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:13,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:13,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:13,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:13,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:13,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:13,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:14,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:14,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:14,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:14,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:14,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:14,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:14,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:14,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:14,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:14,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:14,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:14,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:14,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:14,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:14,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:14,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:14,058 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:14,088 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:51:14,093 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:51:14,096 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:14,099 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:14,101 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:14,103 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) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-01-01 21:51:14,283 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:51:14,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:51:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:14,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:14,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:14,562 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-01-01 21:51:14,567 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 12 treesize of output 11 [2019-01-01 21:51:14,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:14,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:14,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:14,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-01 21:51:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:14,698 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 21:51:14,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 6 states. [2019-01-01 21:51:14,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 6 states. Result 45 states and 56 transitions. Complement of second has 14 states. [2019-01-01 21:51:14,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:51:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-01 21:51:14,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-01 21:51:14,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:14,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:51:14,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:14,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-01 21:51:14,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:14,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-01-01 21:51:14,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:51:14,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 29 transitions. [2019-01-01 21:51:14,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:51:14,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:51:14,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-01-01 21:51:14,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:14,971 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:51:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-01-01 21:51:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-01 21:51:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:51:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-01-01 21:51:15,005 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-01 21:51:15,005 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-01-01 21:51:15,005 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:51:15,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-01-01 21:51:15,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:51:15,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:15,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:15,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:51:15,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:15,007 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 219#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 221#L553-1 assume !main_#t~short9; 222#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 229#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 233#L554-2 [2019-01-01 21:51:15,007 INFO L796 eck$LassoCheckResult]: Loop: 233#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 226#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 231#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 234#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 232#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 233#L554-2 [2019-01-01 21:51:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2019-01-01 21:51:15,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:15,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:15,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:51:15,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:51:15,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:51:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 2 times [2019-01-01 21:51:15,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:15,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:15,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:15,989 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-01 21:51:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:51:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:51:16,058 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 21:51:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:51:16,071 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-01-01 21:51:16,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:51:16,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2019-01-01 21:51:16,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:51:16,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 22 transitions. [2019-01-01 21:51:16,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:51:16,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:51:16,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-01-01 21:51:16,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:16,076 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:51:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-01-01 21:51:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 21:51:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:51:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-01 21:51:16,079 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:51:16,079 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-01-01 21:51:16,079 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:51:16,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-01-01 21:51:16,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:51:16,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:16,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:16,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:51:16,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:16,081 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 262#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 264#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 265#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 272#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 275#L554-2 [2019-01-01 21:51:16,081 INFO L796 eck$LassoCheckResult]: Loop: 275#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 269#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 274#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 277#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 276#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 275#L554-2 [2019-01-01 21:51:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2019-01-01 21:51:16,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:16,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:16,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:16,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 3 times [2019-01-01 21:51:16,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:16,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:16,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -304168138, now seen corresponding path program 1 times [2019-01-01 21:51:16,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:16,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:16,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:16,365 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 10 [2019-01-01 21:51:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:16,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:51:16,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:51:16,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:16,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:16,767 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 21:51:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:16,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:16,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:16,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:16,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:16,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:16,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:16,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-01 21:51:16,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:16,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:16,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 21:51:17,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:17,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,012 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,061 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:19 [2019-01-01 21:51:17,260 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-01 21:51:17,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-01-01 21:51:17,268 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 12 treesize of output 11 [2019-01-01 21:51:17,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-01-01 21:51:17,458 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-01-01 21:51:17,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 126 [2019-01-01 21:51:17,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 21 [2019-01-01 21:51:17,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:17,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2019-01-01 21:51:17,618 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 0 case distinctions, treesize of input 47 treesize of output 41 [2019-01-01 21:51:17,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2019-01-01 21:51:17,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 39 treesize of output 34 [2019-01-01 21:51:17,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:17,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:17,744 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:334, output treesize:52 [2019-01-01 21:51:18,235 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 21:51:18,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:18,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:18,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2019-01-01 21:51:18,315 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 44 [2019-01-01 21:51:18,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 21:51:18,346 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 22 treesize of output 18 [2019-01-01 21:51:18,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:18,363 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 28 treesize of output 20 [2019-01-01 21:51:18,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:18,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:18,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:18,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:20 [2019-01-01 21:51:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:18,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:51:18,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-01 21:51:18,689 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-01 21:51:18,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 21:51:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:51:18,785 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 16 states. [2019-01-01 21:51:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:51:19,513 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-01 21:51:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:51:19,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 21:51:19,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-01 21:51:19,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-01-01 21:51:19,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 21:51:19,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 21:51:19,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-01 21:51:19,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:19,517 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 21:51:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-01 21:51:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-01 21:51:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:51:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-01-01 21:51:19,520 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-01 21:51:19,520 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-01-01 21:51:19,520 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:51:19,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-01-01 21:51:19,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 21:51:19,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:19,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:19,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:51:19,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:19,522 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 363#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 376#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 382#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 380#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 377#L554-2 [2019-01-01 21:51:19,522 INFO L796 eck$LassoCheckResult]: Loop: 377#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 375#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 369#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 370#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 373#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 377#L554-2 [2019-01-01 21:51:19,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 2 times [2019-01-01 21:51:19,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:19,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:19,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 1 times [2019-01-01 21:51:19,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:19,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:19,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash -304168136, now seen corresponding path program 1 times [2019-01-01 21:51:19,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:19,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:19,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:20,165 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-01 21:51:20,635 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2019-01-01 21:51:20,758 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 21:51:20,764 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:20,764 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:20,764 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:20,764 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:20,764 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:20,764 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:20,764 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:20,765 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:20,765 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:51:20,765 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:20,765 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:20,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:20,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,171 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-01-01 21:51:21,321 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:51:21,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:21,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:22,252 WARN L181 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:51:22,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:22,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:22,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:22,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:22,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,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 [2019-01-01 21:51:22,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,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 [2019-01-01 21:51:22,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,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 [2019-01-01 21:51:22,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:22,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:22,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:22,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:22,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:22,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,504 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:51:22,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,508 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:51:22,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:22,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:22,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:22,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:22,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:22,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 [2019-01-01 21:51:22,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:22,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:22,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:22,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:22,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:22,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:22,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:22,573 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:51:22,573 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:51:22,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:22,574 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:22,575 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:22,575 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-01-01 21:51:22,782 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:51:22,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:51:22,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:22,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:22,941 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:51:22,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:22,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:23,093 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-01 21:51:23,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:23,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:23,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:23,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:23,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:23,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:23,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:51:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:23,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:23,246 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2019-01-01 21:51:25,229 WARN L181 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-01 21:51:25,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 85 treesize of output 82 [2019-01-01 21:51:25,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:25,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2019-01-01 21:51:25,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:25,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-01 21:51:25,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:26,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2019-01-01 21:51:26,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2019-01-01 21:51:26,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,108 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 40 treesize of output 35 [2019-01-01 21:51:26,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:51:26,113 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,120 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-01-01 21:51:26,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 53 [2019-01-01 21:51:26,189 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 21:51:26,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2019-01-01 21:51:26,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:51:26,288 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,317 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2019-01-01 21:51:26,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:51:26,377 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,391 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2019-01-01 21:51:26,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:51:26,410 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,426 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,470 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 21:51:26,505 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2019-01-01 21:51:26,628 INFO L303 Elim1Store]: Index analysis took 116 ms [2019-01-01 21:51:26,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2019-01-01 21:51:26,630 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,782 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:51:26,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 92 [2019-01-01 21:51:26,786 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-01-01 21:51:26,863 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2019-01-01 21:51:26,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 33 [2019-01-01 21:51:26,962 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:26,979 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,056 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 67 [2019-01-01 21:51:27,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 33 [2019-01-01 21:51:27,064 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,078 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,147 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 49 treesize of output 44 [2019-01-01 21:51:27,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:51:27,154 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,166 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,191 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:51:27,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-01 21:51:27,557 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 14 treesize of output 13 [2019-01-01 21:51:27,558 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:51:27,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:51:27,616 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,624 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,632 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:27,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:27,671 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-01 21:51:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:27,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:51:27,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 21:51:27,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 38 states and 49 transitions. Complement of second has 10 states. [2019-01-01 21:51:27,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:51:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-01 21:51:27,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 21:51:27,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:27,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:51:27,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:27,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2019-01-01 21:51:27,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:27,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2019-01-01 21:51:27,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-01 21:51:27,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 44 transitions. [2019-01-01 21:51:27,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 21:51:27,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:51:27,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2019-01-01 21:51:27,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:27,980 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-01-01 21:51:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2019-01-01 21:51:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-01-01 21:51:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:51:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-01 21:51:27,984 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 21:51:27,984 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-01 21:51:27,984 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:51:27,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-01-01 21:51:27,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-01 21:51:27,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:27,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:27,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:51:27,986 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:27,986 INFO L794 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 588#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 589#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 603#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 614#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 610#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 611#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 615#L556-1 [2019-01-01 21:51:27,986 INFO L796 eck$LassoCheckResult]: Loop: 615#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 616#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 612#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 613#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 617#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 615#L556-1 [2019-01-01 21:51:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 1 times [2019-01-01 21:51:27,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:27,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:27,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:27,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 4 times [2019-01-01 21:51:28,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:28,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:28,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940577, now seen corresponding path program 1 times [2019-01-01 21:51:28,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:28,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:28,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:28,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:28,553 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-01 21:51:29,653 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2019-01-01 21:51:29,981 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-01-01 21:51:29,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:29,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:29,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:29,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:29,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:29,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:29,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:29,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:29,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:51:29,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:29,986 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:29,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:29,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:29,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:29,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:29,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:30,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,075 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-01-01 21:51:31,468 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:51:31,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:31,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:32,358 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:51:32,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:32,454 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:32,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,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 [2019-01-01 21:51:32,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,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 [2019-01-01 21:51:32,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,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 [2019-01-01 21:51:32,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:32,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:32,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,563 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:51:32,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,567 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:51:32,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:32,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:32,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:32,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:32,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:32,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:32,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:32,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:32,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:32,609 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:32,623 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:51:32,624 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:51:32,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:32,625 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:32,625 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:32,625 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2019-01-01 21:51:33,244 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:51:33,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:51:33,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:33,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:33,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:33,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:33,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:33,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:33,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:33,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:33,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:33,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:51:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:33,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:33,790 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-01-01 21:51:33,793 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 12 treesize of output 11 [2019-01-01 21:51:33,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:33,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:33,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-01 21:51:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:33,849 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 21:51:33,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-01-01 21:51:34,115 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 63 states and 83 transitions. Complement of second has 12 states. [2019-01-01 21:51:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:51:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 21:51:34,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:51:34,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:34,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-01 21:51:34,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:34,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2019-01-01 21:51:34,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:34,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 83 transitions. [2019-01-01 21:51:34,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-01 21:51:34,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 61 states and 81 transitions. [2019-01-01 21:51:34,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 21:51:34,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 21:51:34,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 81 transitions. [2019-01-01 21:51:34,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:34,129 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 81 transitions. [2019-01-01 21:51:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 81 transitions. [2019-01-01 21:51:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-01 21:51:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-01 21:51:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2019-01-01 21:51:34,139 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 77 transitions. [2019-01-01 21:51:34,139 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 77 transitions. [2019-01-01 21:51:34,139 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:51:34,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 77 transitions. [2019-01-01 21:51:34,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-01 21:51:34,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:34,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:34,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2019-01-01 21:51:34,141 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:34,141 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 857#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 858#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 884#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 883#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 882#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 881#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 873#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 870#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 912#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 911#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 872#L554-2 [2019-01-01 21:51:34,141 INFO L796 eck$LassoCheckResult]: Loop: 872#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 865#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 860#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 861#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 868#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 872#L554-2 [2019-01-01 21:51:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash -302321094, now seen corresponding path program 1 times [2019-01-01 21:51:34,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:34,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:51:34,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:51:34,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:34,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:34,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:34,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:34,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:34,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-01 21:51:34,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:34,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 21:51:34,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:34,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,817 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2019-01-01 21:51:34,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-01-01 21:51:34,877 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 12 treesize of output 11 [2019-01-01 21:51:34,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:34,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-01-01 21:51:35,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 124 [2019-01-01 21:51:35,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 35 treesize of output 29 [2019-01-01 21:51:35,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:35,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-01-01 21:51:35,125 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 0 case distinctions, treesize of input 51 treesize of output 48 [2019-01-01 21:51:35,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2019-01-01 21:51:35,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 39 treesize of output 34 [2019-01-01 21:51:35,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:35,198 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:328, output treesize:46 [2019-01-01 21:51:35,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-01 21:51:35,372 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 12 treesize of output 1 [2019-01-01 21:51:35,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,575 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 17 treesize of output 13 [2019-01-01 21:51:35,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:35,601 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 20 treesize of output 14 [2019-01-01 21:51:35,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:35,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:35,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:35,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:14 [2019-01-01 21:51:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:35,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:51:35,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-01 21:51:35,667 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:51:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 55629988, now seen corresponding path program 1 times [2019-01-01 21:51:35,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:35,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:35,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:35,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:35,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:35,946 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-01 21:51:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 21:51:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:51:36,017 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. cyclomatic complexity: 25 Second operand 16 states. [2019-01-01 21:51:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:51:36,610 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2019-01-01 21:51:36,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:51:36,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 91 transitions. [2019-01-01 21:51:36,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 21:51:36,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 91 transitions. [2019-01-01 21:51:36,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-01-01 21:51:36,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-01 21:51:36,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 91 transitions. [2019-01-01 21:51:36,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:36,616 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 91 transitions. [2019-01-01 21:51:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 91 transitions. [2019-01-01 21:51:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-01-01 21:51:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 21:51:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-01-01 21:51:36,647 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-01-01 21:51:36,647 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-01-01 21:51:36,647 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:51:36,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 87 transitions. [2019-01-01 21:51:36,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 21:51:36,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:36,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:36,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1] [2019-01-01 21:51:36,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:36,653 INFO L794 eck$LassoCheckResult]: Stem: 1049#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1047#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1048#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1073#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1074#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1068#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1069#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1085#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1079#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1071#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1072#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1087#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1075#L556-1 [2019-01-01 21:51:36,653 INFO L796 eck$LassoCheckResult]: Loop: 1075#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1076#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1089#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1088#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1086#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 1075#L556-1 [2019-01-01 21:51:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940579, now seen corresponding path program 2 times [2019-01-01 21:51:36,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:36,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 5 times [2019-01-01 21:51:36,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1666915826, now seen corresponding path program 2 times [2019-01-01 21:51:36,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:36,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:37,521 WARN L181 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-01-01 21:51:41,089 WARN L181 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 202 DAG size of output: 160 [2019-01-01 21:51:41,949 WARN L181 SmtUtils]: Spent 854.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-01-01 21:51:41,955 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:41,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:41,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:41,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:41,956 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:41,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:41,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:41,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:41,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-01 21:51:41,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:41,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:41,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:41,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:42,915 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-01-01 21:51:43,148 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:51:43,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:43,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:44,007 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:51:44,076 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:44,076 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:44,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:44,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:44,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:44,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,198 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:51:44,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,203 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:51:44,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:44,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:44,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:44,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:44,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:44,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:44,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:44,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:44,230 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:44,244 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:51:44,244 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:51:44,244 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:44,245 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:44,245 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:44,245 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)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2019-01-01 21:51:44,648 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:51:44,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:51:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:44,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:44,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:44,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:44,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:44,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:44,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:44,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:44,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:44,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:44,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:51:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:44,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:44,857 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-01-01 21:51:44,860 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 12 treesize of output 11 [2019-01-01 21:51:44,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:44,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:44,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:44,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-01 21:51:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:44,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 21:51:44,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 21:51:45,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 92 states and 116 transitions. Complement of second has 12 states. [2019-01-01 21:51:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:51:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 21:51:45,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-01 21:51:45,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:45,078 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:51:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:45,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:45,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:45,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:45,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:45,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:45,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:45,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:51:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:45,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:45,302 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-01-01 21:51:45,305 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 12 treesize of output 11 [2019-01-01 21:51:45,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-01 21:51:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:45,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 21:51:45,360 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 21:51:45,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 92 states and 116 transitions. Complement of second has 12 states. [2019-01-01 21:51:45,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:51:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2019-01-01 21:51:45,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-01 21:51:45,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:45,553 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:51:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:45,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:45,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:45,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:45,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:45,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:45,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:45,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:51:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:45,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:45,794 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-01-01 21:51:45,796 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 12 treesize of output 11 [2019-01-01 21:51:45,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:45,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-01-01 21:51:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:45,847 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 5 loop predicates [2019-01-01 21:51:45,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 21:51:45,988 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 105 states and 132 transitions. Complement of second has 11 states. [2019-01-01 21:51:45,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:51:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-01 21:51:45,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-01 21:51:45,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:45,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 5 letters. [2019-01-01 21:51:45,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:45,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 10 letters. [2019-01-01 21:51:45,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:45,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2019-01-01 21:51:46,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2019-01-01 21:51:46,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 83 states and 105 transitions. [2019-01-01 21:51:46,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 21:51:46,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-01 21:51:46,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 105 transitions. [2019-01-01 21:51:46,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:46,008 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2019-01-01 21:51:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 105 transitions. [2019-01-01 21:51:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 38. [2019-01-01 21:51:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 21:51:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-01-01 21:51:46,016 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-01 21:51:46,016 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-01-01 21:51:46,016 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:51:46,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-01-01 21:51:46,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 21:51:46,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:46,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:46,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:51:46,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:46,020 INFO L794 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1739#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1740#L556-1 [2019-01-01 21:51:46,020 INFO L796 eck$LassoCheckResult]: Loop: 1740#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1745#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1746#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1749#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1742#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1740#L556-1 [2019-01-01 21:51:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:51:46,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:46,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 1 times [2019-01-01 21:51:46,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:46,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:46,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:46,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 3 times [2019-01-01 21:51:46,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:46,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:46,693 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-01 21:51:46,931 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-01-01 21:51:47,014 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:47,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:47,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:47,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:47,015 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:47,015 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:47,015 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:47,015 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:47,015 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration8_Lasso [2019-01-01 21:51:47,015 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:47,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:47,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,496 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-01-01 21:51:47,632 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:51:47,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:48,568 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:51:48,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:48,744 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:48,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,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 [2019-01-01 21:51:48,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,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 [2019-01-01 21:51:48,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:48,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:48,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:48,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,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 [2019-01-01 21:51:48,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,803 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:51:48,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,806 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:51:48,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:48,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:48,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:48,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:48,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:48,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:48,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:48,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:48,934 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:48,938 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:51:48,939 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:51:48,939 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:48,940 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:48,940 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:48,940 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2019-01-01 21:51:49,282 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:51:49,287 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:51:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:49,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:49,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:49,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 21:51:49,467 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 12 treesize of output 11 [2019-01-01 21:51:49,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:49,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:49,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:49,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-01 21:51:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:49,511 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:51:49,511 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 21:51:49,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 58 states and 74 transitions. Complement of second has 9 states. [2019-01-01 21:51:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:51:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2019-01-01 21:51:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-01 21:51:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:49,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:51:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:49,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-01 21:51:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:49,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2019-01-01 21:51:49,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 21:51:49,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 52 states and 67 transitions. [2019-01-01 21:51:49,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 21:51:49,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 21:51:49,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2019-01-01 21:51:49,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:49,612 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2019-01-01 21:51:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2019-01-01 21:51:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-01-01 21:51:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 21:51:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-01-01 21:51:49,615 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-01 21:51:49,615 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-01-01 21:51:49,615 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:51:49,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2019-01-01 21:51:49,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 21:51:49,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:49,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:49,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:51:49,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:49,617 INFO L794 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1986#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1987#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2012#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2011#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2010#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2007#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2009#L556-1 [2019-01-01 21:51:49,617 INFO L796 eck$LassoCheckResult]: Loop: 2009#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1989#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1990#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1997#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2004#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2009#L556-1 [2019-01-01 21:51:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849234, now seen corresponding path program 2 times [2019-01-01 21:51:49,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:49,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:49,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:49,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 2 times [2019-01-01 21:51:49,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:49,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:49,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -782019355, now seen corresponding path program 1 times [2019-01-01 21:51:49,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:49,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:49,964 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-01 21:51:50,877 WARN L181 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 124 [2019-01-01 21:51:51,177 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-01 21:51:51,181 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:51:51,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:51:51,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:51:51,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:51:51,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:51:51,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:51:51,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:51:51,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:51:51,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration9_Lasso [2019-01-01 21:51:51,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:51:51,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:51:51,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,830 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-01-01 21:51:51,960 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:51:51,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:51,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:52,788 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:51:52,900 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:52,900 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:52,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:52,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:52,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:52,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:52,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:52,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:52,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:52,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:52,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:52,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:52,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:52,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:52,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:52,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:52,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:52,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:52,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:52,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:52,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:52,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:52,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:53,007 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:53,023 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:51:53,023 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:51:53,023 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:53,024 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:53,024 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:53,024 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2019-01-01 21:51:53,246 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:51:53,252 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:51:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:53,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:53,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:53,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:53,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:53,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:53,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:53,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:53,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:53,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:53,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:51:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:53,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 21:51:53,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 12 treesize of output 11 [2019-01-01 21:51:53,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:53,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:53,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:53,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-01 21:51:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:53,519 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:51:53,519 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-01 21:51:53,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 119 states and 148 transitions. Complement of second has 10 states. [2019-01-01 21:51:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:51:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-01-01 21:51:53,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:51:53,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:53,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2019-01-01 21:51:53,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:53,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2019-01-01 21:51:53,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:53,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 148 transitions. [2019-01-01 21:51:53,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 21:51:53,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 94 states and 119 transitions. [2019-01-01 21:51:53,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 21:51:53,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-01 21:51:53,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2019-01-01 21:51:53,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:53,631 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 119 transitions. [2019-01-01 21:51:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2019-01-01 21:51:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2019-01-01 21:51:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-01 21:51:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2019-01-01 21:51:53,640 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2019-01-01 21:51:53,640 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2019-01-01 21:51:53,640 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 21:51:53,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 94 transitions. [2019-01-01 21:51:53,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2019-01-01 21:51:53,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:53,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:53,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:51:53,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:51:53,647 INFO L794 eck$LassoCheckResult]: Stem: 2323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2321#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2322#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2330#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2331#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2333#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2326#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2327#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2328#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2329#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2332#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2336#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2339#L556-1 [2019-01-01 21:51:53,647 INFO L796 eck$LassoCheckResult]: Loop: 2339#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2362#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2373#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2371#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2370#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2339#L556-1 [2019-01-01 21:51:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:53,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940641, now seen corresponding path program 2 times [2019-01-01 21:51:53,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:53,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:53,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:53,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:54,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:51:54,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:51:54,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:51:54,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:51:54,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:51:54,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:54,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:54,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:54,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:54,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:54,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:54,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-01 21:51:54,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:54,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 21:51:54,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:54,410 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,414 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,429 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2019-01-01 21:51:54,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2019-01-01 21:51:54,507 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 12 treesize of output 11 [2019-01-01 21:51:54,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-01 21:51:54,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 128 [2019-01-01 21:51:54,820 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-01-01 21:51:54,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 23 [2019-01-01 21:51:54,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:54,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2019-01-01 21:51:54,860 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 0 case distinctions, treesize of input 49 treesize of output 43 [2019-01-01 21:51:54,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 21:51:54,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 41 treesize of output 34 [2019-01-01 21:51:54,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:54,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:54,923 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:330, output treesize:46 [2019-01-01 21:51:55,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-01 21:51:55,099 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 34 treesize of output 33 [2019-01-01 21:51:55,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:55,115 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 33 treesize of output 27 [2019-01-01 21:51:55,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:55,128 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 32 treesize of output 24 [2019-01-01 21:51:55,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:55,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:55,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:51:55,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:24 [2019-01-01 21:51:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:55,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:51:55,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-01-01 21:51:55,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:51:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 3 times [2019-01-01 21:51:55,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:55,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:55,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:55,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:55,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:55,536 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-01-01 21:51:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 21:51:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:51:55,602 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. cyclomatic complexity: 29 Second operand 18 states. [2019-01-01 21:51:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:51:56,314 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2019-01-01 21:51:56,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:51:56,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 123 transitions. [2019-01-01 21:51:56,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-01 21:51:56,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 98 states and 119 transitions. [2019-01-01 21:51:56,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-01 21:51:56,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-01 21:51:56,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 119 transitions. [2019-01-01 21:51:56,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:51:56,324 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 119 transitions. [2019-01-01 21:51:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 119 transitions. [2019-01-01 21:51:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2019-01-01 21:51:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-01 21:51:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2019-01-01 21:51:56,332 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-01-01 21:51:56,332 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2019-01-01 21:51:56,332 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 21:51:56,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 89 transitions. [2019-01-01 21:51:56,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-01-01 21:51:56,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:51:56,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:51:56,338 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:51:56,338 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2019-01-01 21:51:56,338 INFO L794 eck$LassoCheckResult]: Stem: 2560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2558#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2559#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2584#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2609#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2598#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2595#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2593#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2592#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2591#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2590#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2588#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 2589#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2582#L553-1 [2019-01-01 21:51:56,338 INFO L796 eck$LassoCheckResult]: Loop: 2582#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2580#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2581#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2596#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2597#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2592#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2591#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2590#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2588#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 2589#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2582#L553-1 [2019-01-01 21:51:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1958416954, now seen corresponding path program 3 times [2019-01-01 21:51:56,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:56,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:56,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:56,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash 480749795, now seen corresponding path program 1 times [2019-01-01 21:51:56,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:56,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:56,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:51:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:51:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1335499672, now seen corresponding path program 4 times [2019-01-01 21:51:56,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:51:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:51:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:51:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:51:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:56,884 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 21:51:57,079 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:51:57,429 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-01-01 21:51:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 21:51:57,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:51:57,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:51:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:51:57,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:51:57,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:51:57,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:57,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:57,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:51:57,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:57,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:57,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:51:57,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:57,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-01 21:51:58,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:58,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-01 21:51:58,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:51:58,028 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,036 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,337 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:56, output treesize:22 [2019-01-01 21:51:58,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-01 21:51:58,721 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 26 treesize of output 20 [2019-01-01 21:51:58,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:58,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:45 [2019-01-01 21:51:58,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:58,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 195 [2019-01-01 21:51:59,023 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2019-01-01 21:51:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,083 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 103 [2019-01-01 21:51:59,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-01 21:51:59,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 131 [2019-01-01 21:51:59,258 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 90 treesize of output 97 [2019-01-01 21:51:59,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:51:59,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 126 [2019-01-01 21:51:59,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,386 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 144 [2019-01-01 21:51:59,391 INFO L267 ElimStorePlain]: Start of recursive call 7: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-01 21:51:59,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:59,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:59,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:59,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:59,498 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:338, output treesize:50 [2019-01-01 21:51:59,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 119 [2019-01-01 21:51:59,695 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 115 [2019-01-01 21:51:59,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-01 21:51:59,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:59,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:51:59,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:47 [2019-01-01 21:51:59,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:51:59,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 178 [2019-01-01 21:52:00,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,132 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 67 treesize of output 97 [2019-01-01 21:52:00,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:52:00,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 139 [2019-01-01 21:52:00,247 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 91 treesize of output 104 [2019-01-01 21:52:00,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:52:00,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 109 [2019-01-01 21:52:00,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:00,367 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 138 [2019-01-01 21:52:00,372 INFO L267 ElimStorePlain]: Start of recursive call 7: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2019-01-01 21:52:00,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:00,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:00,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:00,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:00,477 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:340, output treesize:56 [2019-01-01 21:52:00,566 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:52:00,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:00,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:00,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:1 [2019-01-01 21:52:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:52:00,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:52:00,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2019-01-01 21:52:01,836 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2019-01-01 21:52:02,119 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 21:52:02,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 21:52:02,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:52:02,120 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. cyclomatic complexity: 26 Second operand 18 states. [2019-01-01 21:52:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:52:03,272 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2019-01-01 21:52:03,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 21:52:03,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 110 transitions. [2019-01-01 21:52:03,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2019-01-01 21:52:03,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 85 states and 98 transitions. [2019-01-01 21:52:03,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-01 21:52:03,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2019-01-01 21:52:03,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 98 transitions. [2019-01-01 21:52:03,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:52:03,278 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 98 transitions. [2019-01-01 21:52:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 98 transitions. [2019-01-01 21:52:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 56. [2019-01-01 21:52:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-01 21:52:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-01-01 21:52:03,281 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-01 21:52:03,281 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-01 21:52:03,281 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 21:52:03,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-01-01 21:52:03,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-01 21:52:03,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:03,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:03,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:52:03,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:52:03,283 INFO L794 eck$LassoCheckResult]: Stem: 2848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2846#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2847#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2877#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2876#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2874#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2875#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2888#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2861#L553-1 [2019-01-01 21:52:03,283 INFO L796 eck$LassoCheckResult]: Loop: 2861#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2901#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2896#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2897#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 2900#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2899#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2857#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2858#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2864#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2850#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2861#L553-1 [2019-01-01 21:52:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash 177751413, now seen corresponding path program 3 times [2019-01-01 21:52:03,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:03,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:03,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1294255583, now seen corresponding path program 1 times [2019-01-01 21:52:03,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:03,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:03,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:03,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2067938965, now seen corresponding path program 1 times [2019-01-01 21:52:03,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:03,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:04,822 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2019-01-01 21:52:05,837 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2019-01-01 21:52:06,887 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 158 DAG size of output: 129 [2019-01-01 21:52:09,985 WARN L181 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-01-01 21:52:09,992 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:52:09,992 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:52:09,992 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:52:09,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:52:09,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:52:09,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:09,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:52:09,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:52:09,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration12_Lasso [2019-01-01 21:52:09,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:52:09,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:52:10,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:10,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:11,257 WARN L181 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-01-01 21:52:11,363 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-01 21:52:11,841 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-01-01 21:52:11,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:11,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:11,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:11,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:11,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:11,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:12,425 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-01 21:52:12,585 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-01 21:52:13,002 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:52:13,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:52:13,143 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:52:13,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:13,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:13,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:13,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:13,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:13,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:13,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:13,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:13,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:13,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:13,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:13,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:13,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:13,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:13,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:13,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:13,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:13,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:13,180 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:52:13,180 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:52:13,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:13,184 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:52:13,184 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:52:13,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:52:13,275 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:52:13,275 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:52:13,275 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:52:13,276 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:52:13,276 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:52:13,276 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2019-01-01 21:52:13,631 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:52:13,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:52:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:13,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:13,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:52:13,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:13,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:13,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:52:13,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:13,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:13,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:13,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:52:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:13,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:13,855 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 21:52:13,857 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 12 treesize of output 11 [2019-01-01 21:52:13,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:13,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:13,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:13,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-01 21:52:13,987 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2019-01-01 21:52:15,969 WARN L181 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-01-01 21:52:15,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 92 treesize of output 86 [2019-01-01 21:52:15,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:16,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-01-01 21:52:16,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:16,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2019-01-01 21:52:16,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:16,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-01 21:52:16,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 13 [2019-01-01 21:52:16,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:16,984 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 40 treesize of output 35 [2019-01-01 21:52:16,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:52:16,990 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:16,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2019-01-01 21:52:17,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-01 21:52:17,028 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,047 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 42 treesize of output 37 [2019-01-01 21:52:17,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:17,051 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,060 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,068 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 76 [2019-01-01 21:52:17,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:17,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 86 [2019-01-01 21:52:17,250 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-01 21:52:17,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-01 21:52:17,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 57 treesize of output 73 [2019-01-01 21:52:17,319 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,333 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2019-01-01 21:52:17,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 43 [2019-01-01 21:52:17,391 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,443 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,473 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:17,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2019-01-01 21:52:17,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 treesize of output 13 [2019-01-01 21:52:17,559 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:52:17,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:17,587 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,595 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,603 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:17,633 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2019-01-01 21:52:17,893 INFO L303 Elim1Store]: Index analysis took 171 ms [2019-01-01 21:52:17,907 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 21:52:17,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 11 [2019-01-01 21:52:17,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:18,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:18,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:18,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2019-01-01 21:52:18,557 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 21:52:19,026 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-01-01 21:52:19,214 INFO L303 Elim1Store]: Index analysis took 186 ms [2019-01-01 21:52:19,397 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 138 [2019-01-01 21:52:22,070 WARN L181 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2019-01-01 21:52:22,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 99 treesize of output 95 [2019-01-01 21:52:22,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2019-01-01 21:52:22,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 108 [2019-01-01 21:52:22,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,600 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 0 case distinctions, treesize of input 83 treesize of output 83 [2019-01-01 21:52:22,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-01 21:52:22,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,626 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 49 treesize of output 42 [2019-01-01 21:52:22,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 32 [2019-01-01 21:52:22,631 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,649 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2019-01-01 21:52:22,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2019-01-01 21:52:22,672 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,695 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 51 treesize of output 44 [2019-01-01 21:52:22,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:22,701 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,709 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,719 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:22,832 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 92 [2019-01-01 21:52:22,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:22,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 136 [2019-01-01 21:52:22,891 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-01 21:52:23,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 91 [2019-01-01 21:52:23,083 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 85 [2019-01-01 21:52:23,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,238 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 0 case distinctions, treesize of input 54 treesize of output 44 [2019-01-01 21:52:23,238 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,254 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2019-01-01 21:52:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,368 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 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-01 21:52:23,368 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,383 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-01 21:52:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,481 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2019-01-01 21:52:23,481 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,501 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,518 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2019-01-01 21:52:23,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 88 [2019-01-01 21:52:23,523 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,539 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,595 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:52:23,704 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2019-01-01 21:52:23,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2019-01-01 21:52:23,757 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:23,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2019-01-01 21:52:23,847 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,916 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 58 treesize of output 51 [2019-01-01 21:52:23,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:23,931 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:23,942 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,004 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2019-01-01 21:52:24,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 58 treesize of output 73 [2019-01-01 21:52:24,009 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,023 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2019-01-01 21:52:24,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:24,082 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,096 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,125 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:24,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:24,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:52:24,183 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2019-01-01 21:52:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:24,212 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 21:52:24,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-01 21:52:24,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 144 states and 171 transitions. Complement of second has 16 states. [2019-01-01 21:52:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 21:52:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:52:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2019-01-01 21:52:24,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-01 21:52:24,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:24,414 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:52:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:24,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:24,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:24,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:52:24,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:24,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:24,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:52:24,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:52:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:24,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:24,575 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 21:52:24,577 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 12 treesize of output 11 [2019-01-01 21:52:24,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:24,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-01 21:52:24,715 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2019-01-01 21:52:26,991 WARN L181 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-01-01 21:52:26,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 92 treesize of output 86 [2019-01-01 21:52:26,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:27,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2019-01-01 21:52:27,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:27,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2019-01-01 21:52:27,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 76 [2019-01-01 21:52:28,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:28,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 86 [2019-01-01 21:52:28,057 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-01 21:52:28,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-01 21:52:28,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 57 treesize of output 73 [2019-01-01 21:52:28,124 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2019-01-01 21:52:28,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 43 [2019-01-01 21:52:28,158 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,175 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:28,247 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 89 [2019-01-01 21:52:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:28,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 100 [2019-01-01 21:52:28,261 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:28,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2019-01-01 21:52:28,364 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2019-01-01 21:52:28,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 32 [2019-01-01 21:52:28,455 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,473 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,536 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 56 treesize of output 51 [2019-01-01 21:52:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-01-01 21:52:28,543 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,555 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,607 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:28,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:28,624 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 0 case distinctions, treesize of input 92 treesize of output 81 [2019-01-01 21:52:28,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2019-01-01 21:52:28,629 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:28,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2019-01-01 21:52:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:28,669 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2019-01-01 21:52:28,670 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,682 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,695 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2019-01-01 21:52:28,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-01 21:52:28,938 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:28,962 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 42 treesize of output 37 [2019-01-01 21:52:28,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:28,971 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,005 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,016 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-01 21:52:29,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 13 [2019-01-01 21:52:29,036 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-01-01 21:52:29,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:52:29,065 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,074 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,085 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2019-01-01 21:52:29,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 treesize of output 13 [2019-01-01 21:52:29,216 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:52:29,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:29,280 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,292 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,301 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,340 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2019-01-01 21:52:29,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 21:52:29,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 11 [2019-01-01 21:52:29,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:29,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2019-01-01 21:52:29,609 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 138 [2019-01-01 21:52:31,932 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2019-01-01 21:52:31,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 99 treesize of output 95 [2019-01-01 21:52:31,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2019-01-01 21:52:32,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 108 [2019-01-01 21:52:32,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,620 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 0 case distinctions, treesize of input 83 treesize of output 83 [2019-01-01 21:52:32,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-01 21:52:32,623 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,648 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 49 treesize of output 42 [2019-01-01 21:52:32,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 32 [2019-01-01 21:52:32,652 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,660 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2019-01-01 21:52:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2019-01-01 21:52:32,695 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,719 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 51 treesize of output 44 [2019-01-01 21:52:32,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:32,728 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,735 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,745 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:32,864 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 92 [2019-01-01 21:52:32,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:32,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 136 [2019-01-01 21:52:32,909 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-01 21:52:33,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 91 [2019-01-01 21:52:33,123 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,286 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:52:33,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 138 [2019-01-01 21:52:33,290 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2019-01-01 21:52:33,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 88 [2019-01-01 21:52:33,448 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,467 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-01 21:52:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,485 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2019-01-01 21:52:33,485 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,505 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,601 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2019-01-01 21:52:33,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,606 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 0 case distinctions, treesize of input 51 treesize of output 53 [2019-01-01 21:52:33,606 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,621 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,762 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:52:33,874 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2019-01-01 21:52:33,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 79 treesize of output 63 [2019-01-01 21:52:33,884 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:33,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:33,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2019-01-01 21:52:33,969 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,045 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2019-01-01 21:52:34,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 58 treesize of output 73 [2019-01-01 21:52:34,050 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,065 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-01-01 21:52:34,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:34,126 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,137 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2019-01-01 21:52:34,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:34,194 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,205 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,230 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:34,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:34,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:52:34,282 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2019-01-01 21:52:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:34,310 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2019-01-01 21:52:34,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-01 21:52:34,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 149 states and 178 transitions. Complement of second has 18 states. [2019-01-01 21:52:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-01 21:52:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:52:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-01 21:52:34,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-01 21:52:34,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:34,474 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:52:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:34,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:34,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:34,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:52:34,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:34,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:34,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:52:34,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:52:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:34,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:34,609 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 21:52:34,611 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 12 treesize of output 11 [2019-01-01 21:52:34,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:34,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-01 21:52:34,739 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2019-01-01 21:52:36,612 WARN L181 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-01-01 21:52:36,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2019-01-01 21:52:36,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:36,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2019-01-01 21:52:36,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 84 treesize of output 78 [2019-01-01 21:52:37,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2019-01-01 21:52:37,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2019-01-01 21:52:37,702 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,722 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 42 treesize of output 37 [2019-01-01 21:52:37,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:37,727 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-01-01 21:52:37,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-01-01 21:52:37,758 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,776 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 40 treesize of output 35 [2019-01-01 21:52:37,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:52:37,781 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,787 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,794 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:37,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 76 [2019-01-01 21:52:37,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:37,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 86 [2019-01-01 21:52:37,982 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2019-01-01 21:52:38,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2019-01-01 21:52:38,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 43 [2019-01-01 21:52:38,049 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,063 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-01 21:52:38,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 57 treesize of output 73 [2019-01-01 21:52:38,100 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,115 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,145 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:38,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2019-01-01 21:52:38,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 30 treesize of output 13 [2019-01-01 21:52:38,229 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:52:38,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:38,258 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,267 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,273 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:38,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,313 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2019-01-01 21:52:38,411 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2019-01-01 21:52:38,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 11 [2019-01-01 21:52:38,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:38,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2019-01-01 21:52:38,638 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 138 [2019-01-01 21:52:40,363 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2019-01-01 21:52:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:40,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 101 [2019-01-01 21:52:40,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:40,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:40,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 112 [2019-01-01 21:52:40,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:40,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 91 treesize of output 87 [2019-01-01 21:52:40,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:40,868 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 92 [2019-01-01 21:52:40,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:40,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:40,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 136 [2019-01-01 21:52:40,915 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-01-01 21:52:41,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 91 [2019-01-01 21:52:41,104 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2019-01-01 21:52:41,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,249 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2019-01-01 21:52:41,249 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,269 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2019-01-01 21:52:41,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 88 [2019-01-01 21:52:41,286 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,305 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2019-01-01 21:52:41,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,399 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 0 case distinctions, treesize of input 51 treesize of output 41 [2019-01-01 21:52:41,399 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,415 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,513 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:52:41,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2019-01-01 21:52:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2019-01-01 21:52:41,744 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,772 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 51 treesize of output 44 [2019-01-01 21:52:41,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:41,778 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,789 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,802 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:41,814 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 0 case distinctions, treesize of input 83 treesize of output 83 [2019-01-01 21:52:41,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-01 21:52:41,819 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,845 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 49 treesize of output 42 [2019-01-01 21:52:41,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 38 treesize of output 32 [2019-01-01 21:52:41,852 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,863 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:41,876 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,001 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2019-01-01 21:52:42,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 79 treesize of output 63 [2019-01-01 21:52:42,008 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:42,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:42,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2019-01-01 21:52:42,096 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2019-01-01 21:52:42,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:42,180 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,191 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,254 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 58 treesize of output 51 [2019-01-01 21:52:42,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 35 [2019-01-01 21:52:42,261 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,275 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:42,331 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:42,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:52:42,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 21:52:42,391 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2019-01-01 21:52:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:42,487 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 7 loop predicates [2019-01-01 21:52:42,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-01 21:52:42,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 153 states and 180 transitions. Complement of second has 23 states. [2019-01-01 21:52:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 21:52:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:52:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2019-01-01 21:52:42,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 10 letters. [2019-01-01 21:52:42,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:42,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 18 letters. Loop has 10 letters. [2019-01-01 21:52:42,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:42,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 20 letters. [2019-01-01 21:52:42,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:42,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 180 transitions. [2019-01-01 21:52:42,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:52:42,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 100 states and 124 transitions. [2019-01-01 21:52:42,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:52:42,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 21:52:42,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 124 transitions. [2019-01-01 21:52:42,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:52:42,687 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-01-01 21:52:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 124 transitions. [2019-01-01 21:52:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 64. [2019-01-01 21:52:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 21:52:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-01-01 21:52:42,691 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-01-01 21:52:42,691 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-01-01 21:52:42,691 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 21:52:42,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2019-01-01 21:52:42,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:52:42,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:42,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:42,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:52:42,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:52:42,693 INFO L794 eck$LassoCheckResult]: Stem: 3729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3727#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 3728#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3757#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3755#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3751#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 3752#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 3740#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3741#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3737#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3738#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 3745#L554-2 [2019-01-01 21:52:42,693 INFO L796 eck$LassoCheckResult]: Loop: 3745#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 3747#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3763#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3762#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3744#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 3745#L554-2 [2019-01-01 21:52:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -302321096, now seen corresponding path program 3 times [2019-01-01 21:52:42,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:42,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:42,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 2 times [2019-01-01 21:52:42,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:42,773 INFO L82 PathProgramCache]: Analyzing trace with hash 337347019, now seen corresponding path program 2 times [2019-01-01 21:52:42,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:42,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:42,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:42,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:43,167 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-01 21:52:44,679 WARN L181 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 179 DAG size of output: 146 [2019-01-01 21:52:44,966 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-01-01 21:52:44,971 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:52:44,971 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:52:44,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:52:44,971 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:52:44,971 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:52:44,971 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:44,971 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:52:44,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:52:44,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration13_Lasso [2019-01-01 21:52:44,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:52:44,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:52:44,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:44,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:44,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:44,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:44,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,429 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-01-01 21:52:45,556 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-01 21:52:45,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:45,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:46,466 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:52:46,637 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:52:46,639 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:52:46,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,686 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:52:46,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:52:46,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:52:46,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:52:46,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:52:46,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,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 [2019-01-01 21:52:46,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,717 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:52:46,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,720 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:52:46,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,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 [2019-01-01 21:52:46,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:52:46,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:52:46,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:52:46,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:52:46,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:52:46,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:52:46,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:52:46,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:52:46,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:52:46,811 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:52:46,811 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:52:46,812 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:52:46,812 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:52:46,812 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:52:46,812 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)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 Supporting invariants [] [2019-01-01 21:52:47,344 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:52:47,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:52:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:47,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:47,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:47,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:52:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:47,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:52:47,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:52:47,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:47,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:47,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:47,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:52:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:52:47,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:52:47,555 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2019-01-01 21:52:49,716 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-01 21:52:49,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 85 treesize of output 82 [2019-01-01 21:52:49,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-01 21:52:50,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:52:50,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2019-01-01 21:52:50,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-01 21:52:50,688 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 14 treesize of output 13 [2019-01-01 21:52:50,688 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:52:50,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:50,719 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,728 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,734 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2019-01-01 21:52:50,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 13 [2019-01-01 21:52:50,971 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:50,995 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 40 treesize of output 35 [2019-01-01 21:52:50,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:52:50,999 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,010 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,021 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,061 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2019-01-01 21:52:51,071 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 0 case distinctions, treesize of input 56 treesize of output 57 [2019-01-01 21:52:51,071 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 51 treesize of output 50 [2019-01-01 21:52:51,166 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,236 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 49 treesize of output 44 [2019-01-01 21:52:51,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:51,241 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,250 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2019-01-01 21:52:51,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:52:51,313 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,321 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,345 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:52:51,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:52:51,408 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-01 21:52:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:52:51,533 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:52:51,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26 Second operand 6 states. [2019-01-01 21:52:51,649 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26. Second operand 6 states. Result 99 states and 122 transitions. Complement of second has 10 states. [2019-01-01 21:52:51,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:52:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:52:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-01 21:52:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 21:52:51,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:51,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 21:52:51,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:51,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-01 21:52:51,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:52:51,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-01-01 21:52:51,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:52:51,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 98 transitions. [2019-01-01 21:52:51,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 21:52:51,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 21:52:51,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 98 transitions. [2019-01-01 21:52:51,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:52:51,656 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 98 transitions. [2019-01-01 21:52:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 98 transitions. [2019-01-01 21:52:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-01-01 21:52:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 21:52:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2019-01-01 21:52:51,659 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2019-01-01 21:52:51,659 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2019-01-01 21:52:51,659 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 21:52:51,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2019-01-01 21:52:51,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-01 21:52:51,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:51,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:51,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-01 21:52:51,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:52:51,660 INFO L794 eck$LassoCheckResult]: Stem: 4073#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4071#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 4072#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4101#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4099#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4089#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4090#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4085#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4087#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4081#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4084#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4091#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4114#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4106#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4112#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4097#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4093#L554-2 [2019-01-01 21:52:51,660 INFO L796 eck$LassoCheckResult]: Loop: 4093#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 4094#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4113#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4082#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4083#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4093#L554-2 [2019-01-01 21:52:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 339194059, now seen corresponding path program 4 times [2019-01-01 21:52:51,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:51,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 3 times [2019-01-01 21:52:51,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:51,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1493309672, now seen corresponding path program 3 times [2019-01-01 21:52:51,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:51,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:51,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:52:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:52,133 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-01 21:52:58,315 WARN L181 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 235 DAG size of output: 183 [2019-01-01 21:52:59,018 WARN L181 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-01 21:52:59,025 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:52:59,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:52:59,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:52:59,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:52:59,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:52:59,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:52:59,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:52:59,026 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:52:59,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration14_Lasso [2019-01-01 21:52:59,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:52:59,027 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:52:59,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:52:59,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,034 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-01-01 21:53:02,168 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-01 21:53:02,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:02,381 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-01 21:53:03,110 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:53:03,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:03,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:03,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:03,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:03,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:03,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,250 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:53:03,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,254 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:53:03,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:03,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:03,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:03,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:03,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:03,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:03,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:03,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:03,277 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:03,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:53:03,282 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:53:03,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:03,283 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:03,283 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:03,283 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)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9 Supporting invariants [] [2019-01-01 21:53:03,639 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:53:03,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:53:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:03,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:03,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:03,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:53:03,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:03,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:03,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:53:03,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:03,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:03,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:03,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:53:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:03,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:03,989 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2019-01-01 21:53:05,420 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-01 21:53:05,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 85 treesize of output 82 [2019-01-01 21:53:05,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:05,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2019-01-01 21:53:05,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:05,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-01 21:53:05,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:53:06,181 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2019-01-01 21:53:06,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2019-01-01 21:53:06,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-01 21:53:06,320 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2019-01-01 21:53:06,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:06,439 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,457 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,541 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 49 treesize of output 44 [2019-01-01 21:53:06,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:06,548 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,568 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,638 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:53:06,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2019-01-01 21:53:06,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2019-01-01 21:53:06,662 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,686 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 40 treesize of output 35 [2019-01-01 21:53:06,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:53:06,691 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,701 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,826 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:06,971 INFO L303 Elim1Store]: Index analysis took 143 ms [2019-01-01 21:53:06,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-01-01 21:53:07,078 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-01 21:53:07,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 53 [2019-01-01 21:53:07,100 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 21:53:07,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2019-01-01 21:53:07,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:07,169 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,188 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2019-01-01 21:53:07,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:07,209 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,229 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2019-01-01 21:53:07,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:07,261 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,279 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,332 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-01-01 21:53:07,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, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-01 21:53:07,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 14 treesize of output 13 [2019-01-01 21:53:07,611 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:53:07,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:07,647 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,661 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,670 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:07,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:53:07,714 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-01 21:53:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:53:07,863 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:53:07,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2019-01-01 21:53:08,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 87 states and 108 transitions. Complement of second has 10 states. [2019-01-01 21:53:08,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:53:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:53:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-01 21:53:08,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 21:53:08,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:08,015 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:53:08,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:08,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:08,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:08,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:53:08,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:08,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:08,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:53:08,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:08,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:08,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:08,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:53:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:08,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:08,331 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2019-01-01 21:53:10,455 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-01 21:53:10,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 85 treesize of output 82 [2019-01-01 21:53:10,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2019-01-01 21:53:11,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2019-01-01 21:53:11,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:53:11,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-01 21:53:11,456 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 14 treesize of output 13 [2019-01-01 21:53:11,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:53:11,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:11,497 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,510 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2019-01-01 21:53:11,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2019-01-01 21:53:11,770 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,791 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 40 treesize of output 35 [2019-01-01 21:53:11,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:53:11,796 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,803 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,809 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,845 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2019-01-01 21:53:11,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2019-01-01 21:53:11,861 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:11,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-01-01 21:53:11,946 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,011 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 49 treesize of output 44 [2019-01-01 21:53:12,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:12,015 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,025 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,090 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2019-01-01 21:53:12,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 29 [2019-01-01 21:53:12,096 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,111 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,171 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 62 [2019-01-01 21:53:12,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:12,178 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,194 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,223 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:53:12,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:53:12,276 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-01 21:53:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:53:12,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:53:12,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2019-01-01 21:53:12,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 87 states and 108 transitions. Complement of second has 10 states. [2019-01-01 21:53:12,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:53:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:53:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-01 21:53:12,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 21:53:12,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:12,551 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:53:12,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:12,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:12,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:53:12,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:53:12,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:53:12,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:12,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:53:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:12,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:12,783 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2019-01-01 21:53:15,625 WARN L181 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2019-01-01 21:53:15,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2019-01-01 21:53:15,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:15,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2019-01-01 21:53:15,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:53:16,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 77 treesize of output 74 [2019-01-01 21:53:16,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2019-01-01 21:53:16,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 13 [2019-01-01 21:53:16,675 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,703 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 40 treesize of output 35 [2019-01-01 21:53:16,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 25 [2019-01-01 21:53:16,744 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,758 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2019-01-01 21:53:16,791 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 0 case distinctions, treesize of input 34 treesize of output 39 [2019-01-01 21:53:16,791 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,812 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 42 treesize of output 37 [2019-01-01 21:53:16,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:16,817 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,825 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,833 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2019-01-01 21:53:16,963 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 14 treesize of output 13 [2019-01-01 21:53:16,963 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2019-01-01 21:53:16,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 28 [2019-01-01 21:53:16,990 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:53:16,999 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:17,006 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:17,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:53:17,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:53:17,041 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2019-01-01 21:53:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:53:17,213 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-01-01 21:53:17,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2019-01-01 21:53:17,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 76 states and 97 transitions. Complement of second has 9 states. [2019-01-01 21:53:17,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:53:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:53:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-01-01 21:53:17,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 21:53:17,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:17,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 21 letters. Loop has 5 letters. [2019-01-01 21:53:17,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:17,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 10 letters. [2019-01-01 21:53:17,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:17,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2019-01-01 21:53:17,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:53:17,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 50 states and 62 transitions. [2019-01-01 21:53:17,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:53:17,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:53:17,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2019-01-01 21:53:17,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:53:17,336 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-01-01 21:53:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2019-01-01 21:53:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-01 21:53:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 21:53:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-01-01 21:53:17,347 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-01-01 21:53:17,347 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-01-01 21:53:17,347 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 21:53:17,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2019-01-01 21:53:17,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:53:17,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:17,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:17,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 21:53:17,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:53:17,349 INFO L794 eck$LassoCheckResult]: Stem: 4745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4743#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~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 4744#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4759#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4785#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4784#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4783#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4782#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4758#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4780#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4779#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4778#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 4770#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4775#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4773#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4771#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4769#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4767#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4764#L553-1 [2019-01-01 21:53:17,349 INFO L796 eck$LassoCheckResult]: Loop: 4764#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4755#L553-3 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem7;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4756#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4762#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4766#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4764#L553-1 [2019-01-01 21:53:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1640222317, now seen corresponding path program 4 times [2019-01-01 21:53:17,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:17,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:17,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 38421686, now seen corresponding path program 4 times [2019-01-01 21:53:17,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:17,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:17,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:17,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:17,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2144846236, now seen corresponding path program 5 times [2019-01-01 21:53:17,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:17,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:17,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:17,884 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-01-01 21:53:18,317 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-01-01 21:53:35,459 WARN L181 SmtUtils]: Spent 17.14 s on a formula simplification. DAG size of input: 271 DAG size of output: 221 [2019-01-01 21:54:16,371 WARN L181 SmtUtils]: Spent 40.90 s on a formula simplification. DAG size of input: 161 DAG size of output: 161 [2019-01-01 21:54:16,377 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:16,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:16,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:16,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:16,377 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:16,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:16,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:16,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:16,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration15_Lasso [2019-01-01 21:54:16,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:16,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:16,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:16,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:57,861 WARN L181 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-01 21:54:58,306 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-01 21:54:58,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:54:58,751 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 21:54:59,080 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-01 21:54:59,290 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-01 21:54:59,701 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:54:59,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:59,856 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:59,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:59,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:59,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:59,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:59,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:59,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:59,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:59,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:59,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:59,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:59,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:59,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:59,913 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:54:59,913 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:54:59,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:59,924 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:54:59,924 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:55:00,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,055 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:55:00,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,057 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:55:00,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:55:00,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:55:00,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:55:00,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:55:00,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,202 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 21:55:00,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,203 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,203 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,205 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,205 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:55:00,205 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:55:00,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,213 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,213 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,217 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,217 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,224 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,225 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:55:00,225 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:55:00,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,227 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,227 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,232 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,232 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,233 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,233 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:55:00,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:55:00,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:55:00,237 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,237 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:55:00,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:55:00,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:55:00,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:55:00,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:55:00,241 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:55:00,241 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:55:00,241 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:55:00,254 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-01-01 21:55:00,255 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-01 21:55:00,622 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:55:00,793 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:55:00,793 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:55:00,794 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:55:00,795 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-01-01 21:55:00,795 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:55:00,795 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 + 1 f1 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10 Supporting invariants [] [2019-01-01 21:55:01,354 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:55:01,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:55:01,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:55:01,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:55:01,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:55:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:55:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:55:01,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:55:01,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:01,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:55:01,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:01,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:01,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:55:01,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:55:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:55:01,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:55:01,642 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2019-01-01 21:55:01,645 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 12 treesize of output 11 [2019-01-01 21:55:01,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,805 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2019-01-01 21:55:01,810 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 12 treesize of output 11 [2019-01-01 21:55:01,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,900 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2019-01-01 21:55:01,905 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 12 treesize of output 11 [2019-01-01 21:55:01,905 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,921 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:01,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:01,966 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2019-01-01 21:55:02,429 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-01-01 21:55:02,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:02,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 162 [2019-01-01 21:55:04,681 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-01-01 21:55:04,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:04,688 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 115 treesize of output 118 [2019-01-01 21:55:04,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:04,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:04,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:04,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2019-01-01 21:55:04,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:05,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2019-01-01 21:55:05,207 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 0 case distinctions, treesize of input 71 treesize of output 69 [2019-01-01 21:55:05,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2019-01-01 21:55:05,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:05,256 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,274 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:05,403 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 0 case distinctions, treesize of input 112 treesize of output 100 [2019-01-01 21:55:05,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:05,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:05,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:05,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2019-01-01 21:55:05,416 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,456 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 76 treesize of output 67 [2019-01-01 21:55:05,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:05,463 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,552 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:05,754 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 152 [2019-01-01 21:55:09,999 WARN L181 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2019-01-01 21:55:10,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 117 [2019-01-01 21:55:10,004 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 127 [2019-01-01 21:55:10,013 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 119 treesize of output 114 [2019-01-01 21:55:10,458 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,918 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 0 case distinctions, treesize of input 92 treesize of output 88 [2019-01-01 21:55:10,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-01 21:55:10,921 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,946 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 51 treesize of output 44 [2019-01-01 21:55:10,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 34 [2019-01-01 21:55:10,952 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,962 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,976 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,987 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 0 case distinctions, treesize of input 106 treesize of output 92 [2019-01-01 21:55:10,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:10,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2019-01-01 21:55:10,998 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 75 [2019-01-01 21:55:11,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,045 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:11,045 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,058 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,073 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 110 [2019-01-01 21:55:11,289 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 0 case distinctions, treesize of input 101 treesize of output 99 [2019-01-01 21:55:11,290 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 124 [2019-01-01 21:55:11,422 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2019-01-01 21:55:11,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,557 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 0 case distinctions, treesize of input 54 treesize of output 52 [2019-01-01 21:55:11,557 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,585 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2019-01-01 21:55:11,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,683 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:11,684 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,706 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2019-01-01 21:55:11,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:11,802 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:11,802 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,821 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,850 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:11,933 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:11,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-01 21:55:11,995 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2019-01-01 21:55:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:55:12,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 21:55:12,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-01 21:55:12,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 72 states and 85 transitions. Complement of second has 12 states. [2019-01-01 21:55:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:55:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:55:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-01 21:55:12,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 18 letters. Loop has 5 letters. [2019-01-01 21:55:12,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:55:12,269 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:55:12,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:55:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:55:12,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:55:12,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:12,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:55:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:12,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:12,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:55:12,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:55:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:55:12,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:55:12,569 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2019-01-01 21:55:12,574 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 12 treesize of output 11 [2019-01-01 21:55:12,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,673 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2019-01-01 21:55:12,677 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 12 treesize of output 11 [2019-01-01 21:55:12,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,799 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2019-01-01 21:55:12,804 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 12 treesize of output 11 [2019-01-01 21:55:12,804 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,820 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:12,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:12,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2019-01-01 21:55:13,361 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-01-01 21:55:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:13,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 162 [2019-01-01 21:55:15,251 WARN L181 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-01-01 21:55:15,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2019-01-01 21:55:15,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,531 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 115 treesize of output 118 [2019-01-01 21:55:15,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2019-01-01 21:55:15,800 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 0 case distinctions, treesize of input 71 treesize of output 69 [2019-01-01 21:55:15,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2019-01-01 21:55:15,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:15,843 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,858 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,875 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:15,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,949 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 0 case distinctions, treesize of input 112 treesize of output 100 [2019-01-01 21:55:15,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:15,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2019-01-01 21:55:15,960 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:16,000 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 76 treesize of output 67 [2019-01-01 21:55:16,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:16,006 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:16,017 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:16,034 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:16,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:16,212 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 152 [2019-01-01 21:55:18,584 WARN L181 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2019-01-01 21:55:18,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 119 treesize of output 114 [2019-01-01 21:55:18,590 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2019-01-01 21:55:19,051 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:19,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 127 [2019-01-01 21:55:19,060 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:19,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 131 [2019-01-01 21:55:19,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 178 [2019-01-01 21:55:19,585 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2019-01-01 21:55:19,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:19,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 114 [2019-01-01 21:55:19,854 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,025 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 77 [2019-01-01 21:55:20,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,034 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 0 case distinctions, treesize of input 56 treesize of output 60 [2019-01-01 21:55:20,034 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,059 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 102 [2019-01-01 21:55:20,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,210 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 0 case distinctions, treesize of input 54 treesize of output 52 [2019-01-01 21:55:20,210 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,236 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 114 [2019-01-01 21:55:20,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,369 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 0 case distinctions, treesize of input 84 treesize of output 125 [2019-01-01 21:55:20,370 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,398 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 93 [2019-01-01 21:55:20,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,493 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 0 case distinctions, treesize of input 67 treesize of output 73 [2019-01-01 21:55:20,494 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,517 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:20,598 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:55:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:20,978 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 0 case distinctions, treesize of input 92 treesize of output 88 [2019-01-01 21:55:20,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-01 21:55:20,982 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,008 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 51 treesize of output 44 [2019-01-01 21:55:21,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 40 treesize of output 34 [2019-01-01 21:55:21,013 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,038 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,052 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,062 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 0 case distinctions, treesize of input 106 treesize of output 92 [2019-01-01 21:55:21,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2019-01-01 21:55:21,071 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 75 [2019-01-01 21:55:21,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:21,111 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,125 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,143 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 110 [2019-01-01 21:55:21,335 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 0 case distinctions, treesize of input 101 treesize of output 99 [2019-01-01 21:55:21,335 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 124 [2019-01-01 21:55:21,474 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,591 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2019-01-01 21:55:21,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,595 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:21,596 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,618 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2019-01-01 21:55:21,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,723 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 0 case distinctions, treesize of input 54 treesize of output 52 [2019-01-01 21:55:21,723 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,749 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2019-01-01 21:55:21,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:21,837 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:21,837 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,858 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,887 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:21,939 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:21,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-01 21:55:21,999 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2019-01-01 21:55:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:55:22,090 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2019-01-01 21:55:22,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-01 21:55:22,298 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 70 states and 82 transitions. Complement of second has 12 states. [2019-01-01 21:55:22,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:55:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:55:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:55:22,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 18 letters. Loop has 5 letters. [2019-01-01 21:55:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:55:22,300 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:55:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:55:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:55:22,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:55:22,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:22,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-01 21:55:22,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:22,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:22,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:55:22,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-01-01 21:55:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:55:22,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:55:22,691 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-01-01 21:55:22,694 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2019-01-01 21:55:22,707 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 12 treesize of output 11 [2019-01-01 21:55:22,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,823 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2019-01-01 21:55:22,827 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 12 treesize of output 11 [2019-01-01 21:55:22,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:22,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:22,920 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2019-01-01 21:55:23,339 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-01-01 21:55:23,389 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 152 [2019-01-01 21:55:27,092 WARN L181 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2019-01-01 21:55:27,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:27,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 127 [2019-01-01 21:55:27,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:27,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:27,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 117 [2019-01-01 21:55:27,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:27,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 119 treesize of output 114 [2019-01-01 21:55:27,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2019-01-01 21:55:28,105 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 0 case distinctions, treesize of input 65 treesize of output 63 [2019-01-01 21:55:28,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 83 [2019-01-01 21:55:28,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,147 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:28,148 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,182 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,460 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 0 case distinctions, treesize of input 106 treesize of output 96 [2019-01-01 21:55:28,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2019-01-01 21:55:28,472 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,512 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 75 [2019-01-01 21:55:28,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,517 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 0 case distinctions, treesize of input 71 treesize of output 75 [2019-01-01 21:55:28,518 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,533 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,550 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,564 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 0 case distinctions, treesize of input 110 treesize of output 110 [2019-01-01 21:55:28,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-01-01 21:55:28,569 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,602 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 69 treesize of output 58 [2019-01-01 21:55:28,607 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 0 case distinctions, treesize of input 54 treesize of output 56 [2019-01-01 21:55:28,608 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,621 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,640 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:28,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:55:28,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:28,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 162 [2019-01-01 21:55:30,567 WARN L181 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2019-01-01 21:55:30,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:30,572 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 115 treesize of output 118 [2019-01-01 21:55:30,573 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:30,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:30,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:30,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2019-01-01 21:55:30,821 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,064 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 0 case distinctions, treesize of input 112 treesize of output 100 [2019-01-01 21:55:31,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2019-01-01 21:55:31,074 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,117 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 76 treesize of output 67 [2019-01-01 21:55:31,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:31,122 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,134 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,149 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 128 [2019-01-01 21:55:31,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:55:31,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,327 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 192 [2019-01-01 21:55:31,328 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2019-01-01 21:55:31,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 32 [2019-01-01 21:55:31,400 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,423 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,446 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 114 [2019-01-01 21:55:31,579 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 0 case distinctions, treesize of input 107 treesize of output 105 [2019-01-01 21:55:31,579 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:55:31,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 130 [2019-01-01 21:55:31,706 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,828 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 86 treesize of output 77 [2019-01-01 21:55:31,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:31,833 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,851 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,951 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2019-01-01 21:55:31,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 63 treesize of output 61 [2019-01-01 21:55:31,956 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-01-01 21:55:31,972 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,020 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,050 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:55:32,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-01 21:55:32,112 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 4 variables, input treesize:689, output treesize:207 [2019-01-01 21:55:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:55:32,205 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 5 loop predicates [2019-01-01 21:55:32,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-01 21:55:32,409 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 91 states and 108 transitions. Complement of second has 11 states. [2019-01-01 21:55:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 21:55:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:55:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2019-01-01 21:55:32,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 5 letters. [2019-01-01 21:55:32,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:55:32,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 23 letters. Loop has 5 letters. [2019-01-01 21:55:32,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:55:32,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 10 letters. [2019-01-01 21:55:32,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:55:32,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 108 transitions. [2019-01-01 21:55:32,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:55:32,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2019-01-01 21:55:32,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:55:32,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:55:32,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:55:32,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:55:32,419 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:55:32,419 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:55:32,419 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:55:32,419 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 21:55:32,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:55:32,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:55:32,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:55:32,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:55:32 BoogieIcfgContainer [2019-01-01 21:55:32,446 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:55:32,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:55:32,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:55:32,447 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:55:32,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:51:09" (3/4) ... [2019-01-01 21:55:32,455 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:55:32,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:55:32,466 INFO L168 Benchmark]: Toolchain (without parser) took 264632.15 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 951.4 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-01 21:55:32,468 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:55:32,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:32,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:32,468 INFO L168 Benchmark]: Boogie Preprocessor took 44.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:55:32,475 INFO L168 Benchmark]: RCFGBuilder took 499.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:55:32,475 INFO L168 Benchmark]: BuchiAutomizer took 263352.83 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-01 21:55:32,476 INFO L168 Benchmark]: Witness Printer took 8.59 ms. Allocated memory is still 6.5 GB. Free memory is still 4.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:55:32,478 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 499.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 263352.83 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 8.59 ms. Allocated memory is still 6.5 GB. Free memory is still 4.6 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 - 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 - 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 15 terminating modules (5 trivial, 6 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function 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[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 2 * unknown-#memory_int-unknown[y][y] + 1 else 2 * unknown-#memory_int-unknown[x][x]) and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 263.2s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 172.9s. Construction of modules took 2.4s. Büchi inclusion checks took 87.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 194 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 72 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/5 HoareTripleCheckerStatistics: 58 SDtfs, 247 SDslu, 68 SDs, 0 SdLazy, 1241 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital3231893 mio100 ax100 hnf99 lsp89 ukn5 mio100 lsp34 div100 bol102 ite100 ukn100 eq176 hnf89 smp92 dnf320 smp87 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 554ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 6 MotzkinApplications: 30 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...