./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-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/NoriSharma-2013FSE-Fig7-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 30b0688e11392273c757e30cbd2949890cabab7f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44:35,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:44:35,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:44:35,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:44:35,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:44:35,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:44:35,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:44:35,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:44:35,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:44:35,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:44:35,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:44:35,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:44:35,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:44:35,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:44:35,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:44:35,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:44:35,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:44:35,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:44:35,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:44:35,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:44:35,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:44:35,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:44:35,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:44:35,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:44:35,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:44:35,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:44:35,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:44:35,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:44:35,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:44:35,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:44:35,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:44:35,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:44:35,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:44:35,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:44:35,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:44:35,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:44:35,508 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:44:35,539 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:44:35,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:44:35,541 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:44:35,541 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:44:35,541 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:44:35,542 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:44:35,542 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:44:35,543 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:44:35,543 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:44:35,543 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:44:35,543 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:44:35,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:44:35,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:44:35,544 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:44:35,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:44:35,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:44:35,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:44:35,544 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:44:35,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:44:35,545 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:44:35,546 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:44:35,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:44:35,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:44:35,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:44:35,547 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:44:35,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:44:35,548 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:44:35,548 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:44:35,549 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:44:35,549 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 -> 30b0688e11392273c757e30cbd2949890cabab7f [2019-01-01 21:44:35,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:44:35,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:44:35,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:44:35,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:44:35,636 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:44:35,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2019-01-01 21:44:35,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f685365/5a1bed1b6039441da9c50632d9d79a78/FLAG341e13906 [2019-01-01 21:44:36,207 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:44:36,208 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2019-01-01 21:44:36,225 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f685365/5a1bed1b6039441da9c50632d9d79a78/FLAG341e13906 [2019-01-01 21:44:36,520 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f685365/5a1bed1b6039441da9c50632d9d79a78 [2019-01-01 21:44:36,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:44:36,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:44:36,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:44:36,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:44:36,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:44:36,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:44:36" (1/1) ... [2019-01-01 21:44:36,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247b5861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:36, skipping insertion in model container [2019-01-01 21:44:36,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:44:36" (1/1) ... [2019-01-01 21:44:36,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:44:36,604 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:44:37,006 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:44:37,021 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:44:37,165 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:44:37,221 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:44:37,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37 WrapperNode [2019-01-01 21:44:37,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:44:37,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:44:37,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:44:37,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:44:37,233 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:44:37" (1/1) ... [2019-01-01 21:44:37,248 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:44:37" (1/1) ... [2019-01-01 21:44:37,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:44:37,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:44:37,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:44:37,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:44:37,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (1/1) ... [2019-01-01 21:44:37,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:44:37,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:44:37,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:44:37,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:44:37,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (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:44:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:44:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:44:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:44:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:44:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:44:37,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:44:37,795 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:44:37,796 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:44:37,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:37 BoogieIcfgContainer [2019-01-01 21:44:37,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:44:37,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:44:37,798 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:44:37,808 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:44:37,809 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:37,810 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:44:36" (1/3) ... [2019-01-01 21:44:37,811 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4015d055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:44:37, skipping insertion in model container [2019-01-01 21:44:37,811 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:37,812 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:37" (2/3) ... [2019-01-01 21:44:37,812 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4015d055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:44:37, skipping insertion in model container [2019-01-01 21:44:37,812 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:37,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:37" (3/3) ... [2019-01-01 21:44:37,815 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2019-01-01 21:44:37,873 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:44:37,874 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:44:37,874 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:44:37,874 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:44:37,874 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:44:37,874 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:44:37,874 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:44:37,874 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:44:37,874 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:44:37,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:44:37,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:44:37,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:44:37,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:44:37,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:44:37,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:44:37,917 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:44:37,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-01 21:44:37,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:44:37,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:44:37,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:44:37,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:44:37,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:44:37,927 INFO L794 eck$LassoCheckResult]: Stem: 4#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~short15, main_~a~0.base, main_~a~0.offset, main_~i~0.base, main_~i~0.offset, main_~b~0.base, main_~b~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset, main_~M~0.base, main_~M~0.offset, main_~N~0.base, main_~N~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~b~0.base, main_~b~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~M~0.base, main_~M~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~N~0.base, main_~N~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~i~0.base, main_~i~0.offset, 4);call write~int(main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10, main_~b~0.base, main_~b~0.offset, 4);havoc main_#t~mem10;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 5#L557-5true [2019-01-01 21:44:37,928 INFO L796 eck$LassoCheckResult]: Loop: 5#L557-5true call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4);call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4);main_#t~short15 := main_#t~mem11 < main_#t~mem12; 8#L557-1true assume main_#t~short15; 11#L557-3true assume !!main_#t~short15;havoc main_#t~mem12;havoc main_#t~mem14;havoc main_#t~short15;havoc main_#t~mem11;havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~i~0.base, main_~i~0.offset, 4);call write~int(1 + main_#t~mem16, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(1 + main_#t~mem17, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem18, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem18; 5#L557-5true [2019-01-01 21:44:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:44:37,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2019-01-01 21:44:38,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:38,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:38,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:38,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:38,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-01-01 21:44:38,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:38,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:39,096 WARN L181 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-01 21:44:40,905 WARN L181 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 162 DAG size of output: 144 [2019-01-01 21:44:41,597 WARN L181 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-01-01 21:44:41,626 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:44:41,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:44:41,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:44:41,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:44:41,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:44:41,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:44:41,630 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:44:41,630 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:44:41,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:44:41,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:44:41,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:44:41,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:44:41,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:41,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:41,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:41,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:44:41,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:41,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:44:41,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:41,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:41,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44: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:44:41,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:44:42,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:44:42,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:42,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:43,648 WARN L181 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 121 [2019-01-01 21:44:44,018 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-01-01 21:44:44,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:44:44,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:44,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:44:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:44,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:44:44,537 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-01 21:44:44,793 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:44:44,898 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:44:45,495 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:45:10,993 WARN L181 SmtUtils]: Spent 25.38 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-01 21:45:11,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:45:11,107 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:45:11,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:11,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:11,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:11,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:11,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:11,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:11,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:45:11,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:11,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:11,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:11,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:11,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:11,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:11,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:11,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:45:11,264 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:45:11,264 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:45:11,267 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:45:11,268 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:45:11,268 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:45:11,269 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~M~0.base) ULTIMATE.start_main_~M~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 Supporting invariants [] [2019-01-01 21:45:12,425 INFO L297 tatePredicateManager]: 102 out of 104 supporting invariants were superfluous and have been removed [2019-01-01 21:45:12,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:45:12,437 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:45:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:12,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:12,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:12,659 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:45:12,676 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:45:12,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-01-01 21:45:12,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 4 states. Result 33 states and 39 transitions. Complement of second has 9 states. [2019-01-01 21:45:12,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:45:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:45:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 21:45:12,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:45:12,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:12,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:45:12,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:12,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:45:12,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:45:12,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2019-01-01 21:45:12,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:45:12,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 15 transitions. [2019-01-01 21:45:12,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:45:12,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:45:12,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-01-01 21:45:12,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:45:12,863 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:45:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-01-01 21:45:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 21:45:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:45:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 21:45:12,890 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:45:12,891 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:45:12,891 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:45:12,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 21:45:12,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:45:12,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:45:12,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:45:12,892 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:45:12,892 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:45:12,893 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~short15, main_~a~0.base, main_~a~0.offset, main_~i~0.base, main_~i~0.offset, main_~b~0.base, main_~b~0.offset, main_~j~0.base, main_~j~0.offset, main_~c~0.base, main_~c~0.offset, main_~M~0.base, main_~M~0.offset, main_~N~0.base, main_~N~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~a~0.base, main_~a~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~b~0.base, main_~b~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~j~0.base, main_~j~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(4);main_~M~0.base, main_~M~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4);main_~N~0.base, main_~N~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~i~0.base, main_~i~0.offset, 4);call write~int(main_#t~mem9, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(main_#t~mem10, main_~b~0.base, main_~b~0.offset, 4);havoc main_#t~mem10;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 510#L557-5 call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4);call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4);main_#t~short15 := main_#t~mem11 < main_#t~mem12; 513#L557-1 [2019-01-01 21:45:12,893 INFO L796 eck$LassoCheckResult]: Loop: 513#L557-1 assume !main_#t~short15;call main_#t~mem13 := read~int(main_~j~0.base, main_~j~0.offset, 4);call main_#t~mem14 := read~int(main_~N~0.base, main_~N~0.offset, 4);main_#t~short15 := main_#t~mem13 < main_#t~mem14; 516#L557-3 assume !!main_#t~short15;havoc main_#t~mem12;havoc main_#t~mem14;havoc main_#t~short15;havoc main_#t~mem11;havoc main_#t~mem13;call main_#t~mem16 := read~int(main_~i~0.base, main_~i~0.offset, 4);call write~int(1 + main_#t~mem16, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~j~0.base, main_~j~0.offset, 4);call write~int(1 + main_#t~mem17, main_~j~0.base, main_~j~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem18, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem18; 512#L557-5 call main_#t~mem11 := read~int(main_~i~0.base, main_~i~0.offset, 4);call main_#t~mem12 := read~int(main_~M~0.base, main_~M~0.offset, 4);main_#t~short15 := main_#t~mem11 < main_#t~mem12; 513#L557-1 [2019-01-01 21:45:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:45:12,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:12,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash 41888, now seen corresponding path program 1 times [2019-01-01 21:45:12,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:12,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:12,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 889571357, now seen corresponding path program 1 times [2019-01-01 21:45:13,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:45:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:45:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:45:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:45:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:45:13,443 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-01-01 21:45:13,714 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 21:45:15,044 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 183 DAG size of output: 159 [2019-01-01 21:45:16,570 WARN L181 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 156 [2019-01-01 21:45:16,581 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:45:16,581 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:45:16,581 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:45:16,581 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:45:16,582 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:45:16,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:45:16,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:45:16,583 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:45:16,583 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:45:16,583 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:45:16,583 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:45:16,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,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:45:16,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:16,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:20,156 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 179 DAG size of output: 139 [2019-01-01 21:45:21,890 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2019-01-01 21:45:21,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:21,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:21,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:21,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:45:22,248 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-01 21:45:22,551 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-01 21:45:22,762 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-01 21:45:22,988 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 21:45:47,791 WARN L181 SmtUtils]: Spent 24.65 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-01 21:45:48,044 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-01-01 21:45:48,111 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:45:48,111 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:45:48,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:45:48,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,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:45:48,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,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:45:48,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,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:45:48,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,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:45:48,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,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:45:48,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,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:45:48,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:45:48,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:45:48,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:45:48,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:45:48,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:45:48,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:45:48,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:45:48,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:45:48,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:45:48,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:45:48,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:45:48,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:45:48,250 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:45:48,251 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:45:48,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:45:48,251 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:45:48,251 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:45:48,251 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~N~0.base) ULTIMATE.start_main_~N~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~j~0.base) ULTIMATE.start_main_~j~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~N~0.base) ULTIMATE.start_main_~N~0.offset)_1 Supporting invariants [] [2019-01-01 21:45:49,405 INFO L297 tatePredicateManager]: 120 out of 124 supporting invariants were superfluous and have been removed [2019-01-01 21:45:49,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:45:49,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:45:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:45:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:49,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2019-01-01 21:45:49,525 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 40 treesize of output 39 [2019-01-01 21:45:49,560 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 39 treesize of output 38 [2019-01-01 21:45:49,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-01-01 21:45:49,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2019-01-01 21:45:49,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:49,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-01 21:45:49,667 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:49,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:49,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:49,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:49,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:49,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,025 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2019-01-01 21:45:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:45:50,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:45:50,236 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-01-01 21:45:50,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,376 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 1 case distinctions, treesize of input 174 treesize of output 116 [2019-01-01 21:45:50,531 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:45:50,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,537 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 12 treesize of output 16 [2019-01-01 21:45:50,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,665 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 76 treesize of output 83 [2019-01-01 21:45:50,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 63 [2019-01-01 21:45:50,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,759 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2019-01-01 21:45:50,761 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 85 [2019-01-01 21:45:50,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:45:50,861 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,874 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:50,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:50,994 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 52 treesize of output 61 [2019-01-01 21:45:50,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:45:51,001 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,012 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,154 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 51 treesize of output 60 [2019-01-01 21:45:51,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:45:51,160 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,171 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:51,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,215 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2019-01-01 21:45:51,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,223 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 60 treesize of output 47 [2019-01-01 21:45:51,224 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,255 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 44 treesize of output 52 [2019-01-01 21:45:51,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-01 21:45:51,266 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,282 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:51,294 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:45:51,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,434 INFO L303 Elim1Store]: Index analysis took 138 ms [2019-01-01 21:45:51,465 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 98 [2019-01-01 21:45:51,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:51,504 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 73 treesize of output 78 [2019-01-01 21:45:51,506 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:52,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:52,060 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 57 treesize of output 58 [2019-01-01 21:45:52,061 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:52,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:53,000 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 64 treesize of output 63 [2019-01-01 21:45:53,002 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:53,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:53,596 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 56 treesize of output 65 [2019-01-01 21:45:53,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:53,608 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 23 treesize of output 16 [2019-01-01 21:45:53,609 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:53,627 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,009 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 51 treesize of output 56 [2019-01-01 21:45:54,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,017 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 45 treesize of output 46 [2019-01-01 21:45:54,018 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,029 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 83 [2019-01-01 21:45:54,127 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:54,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,166 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 139 [2019-01-01 21:45:54,168 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2019-01-01 21:45:54,254 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:54,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,481 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 55 treesize of output 64 [2019-01-01 21:45:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,487 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 23 treesize of output 16 [2019-01-01 21:45:54,487 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,500 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,593 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:45:54,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:45:54,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,667 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 176 treesize of output 108 [2019-01-01 21:45:54,781 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 21:45:54,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,788 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 80 treesize of output 78 [2019-01-01 21:45:54,789 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,794 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 80 treesize of output 76 [2019-01-01 21:45:54,796 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,801 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 80 treesize of output 78 [2019-01-01 21:45:54,803 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,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, 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 74 [2019-01-01 21:45:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,925 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 45 treesize of output 34 [2019-01-01 21:45:54,927 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,954 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 46 treesize of output 63 [2019-01-01 21:45:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:45:54,959 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,969 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,978 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:54,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2019-01-01 21:45:54,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:54,994 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 60 treesize of output 47 [2019-01-01 21:45:54,996 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,125 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-01 21:45:55,126 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 0 case distinctions, treesize of input 46 treesize of output 54 [2019-01-01 21:45:55,140 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 39 [2019-01-01 21:45:55,142 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,190 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,202 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,237 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 76 treesize of output 89 [2019-01-01 21:45:55,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,246 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 78 treesize of output 67 [2019-01-01 21:45:55,247 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,335 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 57 treesize of output 58 [2019-01-01 21:45:55,336 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,444 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 0 case distinctions, treesize of input 53 treesize of output 58 [2019-01-01 21:45:55,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,452 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 48 [2019-01-01 21:45:55,453 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,461 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,548 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 3 case distinctions, treesize of input 50 treesize of output 76 [2019-01-01 21:45:55,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,559 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 62 treesize of output 59 [2019-01-01 21:45:55,560 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,625 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 45 treesize of output 48 [2019-01-01 21:45:55,626 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,650 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,684 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:55,724 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:45:55,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:55,775 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 4 case distinctions, treesize of input 174 treesize of output 123 [2019-01-01 21:45:56,412 WARN L181 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-01 21:45:56,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:56,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 103 [2019-01-01 21:45:56,427 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:56,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:56,435 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 102 treesize of output 105 [2019-01-01 21:45:56,436 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:56,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:56,445 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 100 treesize of output 103 [2019-01-01 21:45:56,445 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:57,459 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 87 treesize of output 98 [2019-01-01 21:45:57,460 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:57,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:57,469 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 87 treesize of output 100 [2019-01-01 21:45:57,471 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:57,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:57,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 98 [2019-01-01 21:45:57,483 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:58,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,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, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 113 [2019-01-01 21:45:58,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,609 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 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 91 treesize of output 129 [2019-01-01 21:45:58,610 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-01-01 21:45:58,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 111 [2019-01-01 21:45:58,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,849 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 91 [2019-01-01 21:45:58,853 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:45:58,897 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:58,914 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:45:58,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:58,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 141 [2019-01-01 21:45:59,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:59,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:45:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:59,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:45:59,022 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 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 121 treesize of output 153 [2019-01-01 21:45:59,023 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:00,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:00,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:00,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:00,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:00,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:00,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 148 [2019-01-01 21:46:00,377 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2019-01-01 21:46:01,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:01,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:01,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:01,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 132 [2019-01-01 21:46:01,442 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2019-01-01 21:46:03,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 144 [2019-01-01 21:46:03,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:03,678 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 137 treesize of output 130 [2019-01-01 21:46:03,679 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:03,800 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:05,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:05,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 169 [2019-01-01 21:46:05,373 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 114 [2019-01-01 21:46:06,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,059 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 111 treesize of output 104 [2019-01-01 21:46:06,062 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:06,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,187 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 101 [2019-01-01 21:46:06,189 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 3 xjuncts. [2019-01-01 21:46:06,293 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:06,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 114 [2019-01-01 21:46:06,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,885 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 90 [2019-01-01 21:46:06,886 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:46:06,928 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 21:46:06,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 108 [2019-01-01 21:46:06,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:06,994 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 87 [2019-01-01 21:46:06,997 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:46:07,044 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:08,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,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, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 130 [2019-01-01 21:46:08,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,250 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:08,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,256 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:08,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:08,350 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-01 21:46:08,447 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 242 [2019-01-01 21:46:08,451 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 8 xjuncts. [2019-01-01 21:46:08,903 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 21:46:09,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,501 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 3 case distinctions, treesize of input 80 treesize of output 108 [2019-01-01 21:46:09,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,524 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 105 treesize of output 98 [2019-01-01 21:46:09,525 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:09,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 70 treesize of output 117 [2019-01-01 21:46:09,657 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 3 xjuncts. [2019-01-01 21:46:09,759 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:46:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,849 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 3 case distinctions, treesize of input 88 treesize of output 114 [2019-01-01 21:46:09,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,857 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 113 treesize of output 106 [2019-01-01 21:46:09,857 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:09,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:09,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 147 [2019-01-01 21:46:10,012 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 9 xjuncts. [2019-01-01 21:46:10,275 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:46:10,713 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: 1 dim-0 vars, and 13 xjuncts. [2019-01-01 21:46:10,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 126 [2019-01-01 21:46:10,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,787 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:10,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,802 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 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 117 treesize of output 149 [2019-01-01 21:46:10,803 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:10,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:10,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 136 [2019-01-01 21:46:10,978 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2019-01-01 21:46:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 140 [2019-01-01 21:46:11,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,370 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 134 treesize of output 127 [2019-01-01 21:46:11,371 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:11,490 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:11,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 110 [2019-01-01 21:46:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:11,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 100 [2019-01-01 21:46:11,791 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 64 treesize of output 115 [2019-01-01 21:46:12,522 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 9 xjuncts. [2019-01-01 21:46:12,653 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:46:12,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,873 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 3 case distinctions, treesize of input 76 treesize of output 104 [2019-01-01 21:46:12,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,881 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 101 treesize of output 94 [2019-01-01 21:46:12,881 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:12,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,013 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 133 [2019-01-01 21:46:13,017 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 9 xjuncts. [2019-01-01 21:46:13,203 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 21:46:13,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,250 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 3 case distinctions, treesize of input 84 treesize of output 110 [2019-01-01 21:46:13,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 102 [2019-01-01 21:46:13,257 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:13,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 72 treesize of output 163 [2019-01-01 21:46:13,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:46:13,443 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 27 xjuncts. [2019-01-01 21:46:13,745 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-01 21:46:14,068 INFO L267 ElimStorePlain]: Start of recursive call 82: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 13 xjuncts. [2019-01-01 21:46:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:15,524 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2019-01-01 21:46:15,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:15,577 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 60 treesize of output 47 [2019-01-01 21:46:15,578 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:15,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:15,730 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 44 treesize of output 52 [2019-01-01 21:46:15,735 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-01 21:46:15,736 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:15,745 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:15,759 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:15,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:15,810 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 106 [2019-01-01 21:46:15,846 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 21:46:15,846 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:16,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:16,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2019-01-01 21:46:16,455 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:17,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:17,028 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2019-01-01 21:46:17,029 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:17,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:17,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:17,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:17,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2019-01-01 21:46:17,551 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:18,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 97 [2019-01-01 21:46:18,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,059 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 23 treesize of output 16 [2019-01-01 21:46:18,060 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:18,082 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:18,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 71 treesize of output 87 [2019-01-01 21:46:18,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:18,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,528 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-01 21:46:18,538 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 139 [2019-01-01 21:46:18,540 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 2 xjuncts. [2019-01-01 21:46:18,622 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2019-01-01 21:46:18,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:18,958 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 23 treesize of output 16 [2019-01-01 21:46:18,958 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:18,982 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,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, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 126 [2019-01-01 21:46:19,561 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 120 treesize of output 105 [2019-01-01 21:46:19,561 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,641 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:19,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 64 [2019-01-01 21:46:19,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,823 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2019-01-01 21:46:19,824 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,837 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,945 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 59 treesize of output 68 [2019-01-01 21:46:19,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:19,950 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 23 treesize of output 16 [2019-01-01 21:46:19,950 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:19,963 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,041 INFO L267 ElimStorePlain]: Start of recursive call 100: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:20,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,074 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 84 treesize of output 91 [2019-01-01 21:46:20,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,192 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-01 21:46:20,193 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 77 treesize of output 82 [2019-01-01 21:46:20,193 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2019-01-01 21:46:20,290 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 93 [2019-01-01 21:46:20,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:46:20,405 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,426 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,495 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 55 treesize of output 64 [2019-01-01 21:46:20,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:46:20,500 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,513 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,580 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 60 treesize of output 69 [2019-01-01 21:46:20,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:46:20,586 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,600 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:20,632 INFO L267 ElimStorePlain]: Start of recursive call 117: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:21,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 81 [2019-01-01 21:46:21,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-01-01 21:46:21,035 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 61 [2019-01-01 21:46:21,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-01 21:46:21,070 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,077 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,087 INFO L267 ElimStorePlain]: Start of recursive call 126: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 96 [2019-01-01 21:46:21,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2019-01-01 21:46:21,134 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2019-01-01 21:46:21,237 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,322 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 0 case distinctions, treesize of input 58 treesize of output 63 [2019-01-01 21:46:21,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,329 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2019-01-01 21:46:21,330 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,344 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,424 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2019-01-01 21:46:21,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 21:46:21,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,441 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 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 76 treesize of output 108 [2019-01-01 21:46:21,442 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,471 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,560 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 3 case distinctions, treesize of input 55 treesize of output 81 [2019-01-01 21:46:21,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,567 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 72 treesize of output 65 [2019-01-01 21:46:21,567 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2019-01-01 21:46:21,628 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,660 INFO L267 ElimStorePlain]: Start of recursive call 137: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:21,696 INFO L267 ElimStorePlain]: Start of recursive call 130: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:21,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,746 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 82 treesize of output 96 [2019-01-01 21:46:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:21,779 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 71 treesize of output 68 [2019-01-01 21:46:21,780 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,256 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 68 treesize of output 67 [2019-01-01 21:46:22,256 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:22,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:22,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:22,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:22,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:22,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 107 [2019-01-01 21:46:22,371 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 74 [2019-01-01 21:46:22,374 INFO L267 ElimStorePlain]: Start of recursive call 144: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 21:46:22,412 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:46:22,464 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 0 case distinctions, treesize of input 57 treesize of output 62 [2019-01-01 21:46:22,469 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-01-01 21:46:22,470 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,483 INFO L267 ElimStorePlain]: Start of recursive call 145: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:46:22,547 INFO L267 ElimStorePlain]: Start of recursive call 140: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:46:22,641 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-01-01 21:46:22,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2019-01-01 21:46:22,806 INFO L202 ElimStorePlain]: Needed 146 recursive calls to eliminate 3 variables, input treesize:226, output treesize:486 [2019-01-01 21:46:23,030 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-01 21:46:23,031 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:46:23,033 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:46:23,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-01 21:46:23,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 22 states and 30 transitions. Complement of second has 7 states. [2019-01-01 21:46:23,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:46:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:46:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 21:46:23,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:46:23,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:23,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:46:23,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:23,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:46:23,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:46:23,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-01-01 21:46:23,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:46:23,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-01 21:46:23,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:46:23,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:46:23,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:46:23,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:46:23,104 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:23,104 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:23,104 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:46:23,104 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:46:23,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:46:23,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:46:23,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:46:23,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:46:23 BoogieIcfgContainer [2019-01-01 21:46:23,111 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:46:23,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:46:23,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:46:23,112 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:46:23,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:37" (3/4) ... [2019-01-01 21:46:23,116 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:46:23,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:46:23,117 INFO L168 Benchmark]: Toolchain (without parser) took 106592.32 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 601.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -61.8 MB). Peak memory consumption was 540.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:23,118 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:23,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:23,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.48 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:46:23,118 INFO L168 Benchmark]: Boogie Preprocessor took 29.25 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:46:23,119 INFO L168 Benchmark]: RCFGBuilder took 495.91 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:23,119 INFO L168 Benchmark]: BuchiAutomizer took 105313.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 459.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.1 MB). Peak memory consumption was 545.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:46:23,119 INFO L168 Benchmark]: Witness Printer took 4.51 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:46:23,124 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.48 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. * Boogie Preprocessor took 29.25 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 495.91 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 105313.96 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 459.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.1 MB). Peak memory consumption was 545.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.51 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[M][M] + -1 * unknown-#memory_int-unknown[i][i] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[j][j] + unknown-#memory_int-unknown[N][N] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 105.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 71.0s. Construction of modules took 0.0s. Büchi inclusion checks took 34.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 18 SDslu, 9 SDs, 0 SdLazy, 22 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1077 mio100 ax102 hnf99 lsp72 ukn72 mio100 lsp26 div100 bol100 ite100 ukn100 eq194 hnf87 smp96 dnf5964 smp88 tf100 neg91 sie128 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...