./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/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-0ed9222-m [2019-01-14 02:27:23,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:27:23,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:27:23,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:27:23,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:27:23,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:27:23,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:27:23,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:27:23,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:27:23,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:27:23,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:27:23,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:27:23,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:27:23,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:27:23,330 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:27:23,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:27:23,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:27:23,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:27:23,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:27:23,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:27:23,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:27:23,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:27:23,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:27:23,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:27:23,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:27:23,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:27:23,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:27:23,350 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:27:23,351 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:27:23,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:27:23,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:27:23,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:27:23,354 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:27:23,354 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:27:23,355 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:27:23,356 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:27:23,356 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:27:23,374 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:27:23,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:27:23,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:27:23,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:27:23,376 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:27:23,377 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:27:23,377 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:27:23,377 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:27:23,377 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:27:23,377 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:27:23,378 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:27:23,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:27:23,379 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:27:23,379 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:27:23,380 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:27:23,380 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:27:23,380 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:27:23,380 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:27:23,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:27:23,380 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:27:23,382 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:27:23,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:27:23,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:27:23,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:27:23,383 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:27:23,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:27:23,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:27:23,383 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:27:23,385 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:27:23,386 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-14 02:27:23,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:27:23,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:27:23,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:27:23,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:27:23,479 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:27:23,480 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-14 02:27:23,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45129ed48/290023c1795943f495281164e97d9e69/FLAGc7e74663f [2019-01-14 02:27:24,130 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:27:24,131 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2019-01-14 02:27:24,150 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45129ed48/290023c1795943f495281164e97d9e69/FLAGc7e74663f [2019-01-14 02:27:24,379 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45129ed48/290023c1795943f495281164e97d9e69 [2019-01-14 02:27:24,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:27:24,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:27:24,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:27:24,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:27:24,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:27:24,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:27:24" (1/1) ... [2019-01-14 02:27:24,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2081047e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:24, skipping insertion in model container [2019-01-14 02:27:24,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:27:24" (1/1) ... [2019-01-14 02:27:24,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:27:24,477 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:27:24,896 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:27:24,921 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:27:25,132 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:27:25,194 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:27:25,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25 WrapperNode [2019-01-14 02:27:25,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:27:25,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:27:25,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:27:25,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:27:25,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:27:25,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:27:25,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:27:25,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:27:25,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... [2019-01-14 02:27:25,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:27:25,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:27:25,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:27:25,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:27:25,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:27:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:27:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:27:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:27:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:27:25,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:27:25,744 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:27:25,744 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:27:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:25 BoogieIcfgContainer [2019-01-14 02:27:25,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:27:25,756 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:27:25,756 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:27:25,764 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:27:25,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:25,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:27:24" (1/3) ... [2019-01-14 02:27:25,771 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee24430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:27:25, skipping insertion in model container [2019-01-14 02:27:25,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:25,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:27:25" (2/3) ... [2019-01-14 02:27:25,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ee24430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:27:25, skipping insertion in model container [2019-01-14 02:27:25,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:27:25,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:25" (3/3) ... [2019-01-14 02:27:25,782 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i [2019-01-14 02:27:25,869 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:27:25,870 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:27:25,870 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:27:25,870 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:27:25,871 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:27:25,871 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:27:25,871 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:27:25,871 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:27:25,872 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:27:25,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:27:25,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:27:25,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:25,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:25,928 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:25,928 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:27:25,928 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:27:25,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2019-01-14 02:27:25,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:27:25,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:25,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:25,931 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:27:25,931 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:27:25,941 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-14 02:27:25,942 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~short15;havoc main_#t~mem12;havoc main_#t~mem14;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-14 02:27:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:27:25,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:25,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2019-01-14 02:27:26,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:26,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:26,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:26,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:26,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-01-14 02:27:26,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:26,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:26,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:27:27,029 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-14 02:27:27,263 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-14 02:27:29,171 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 162 DAG size of output: 144 [2019-01-14 02:27:29,824 WARN L181 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-01-14 02:27:29,843 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:27:29,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:27:29,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:27:29,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:27:29,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:27:29,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:27:29,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:27:29,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:27:29,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:27:29,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:27:29,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:27:29,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,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-14 02:27:29,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:29,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:31,702 WARN L181 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 121 [2019-01-14 02:27:32,045 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-01-14 02:27:32,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:32,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:32,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:32,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:32,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:27:32,492 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-14 02:27:32,629 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:27:32,806 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:27:32,879 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:27:33,493 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:27:58,085 WARN L181 SmtUtils]: Spent 24.48 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-14 02:27:58,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:27:58,202 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:27:58,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,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-14 02:27:58,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:27:58,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:27:58,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:27:58,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:27:58,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:27:58,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:27:58,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:27:58,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:27:58,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:27:58,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:27:58,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:27:58,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:27:58,361 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:27:58,361 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:27:58,364 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:27:58,364 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:27:58,365 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:27:58,365 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-14 02:27:59,454 INFO L297 tatePredicateManager]: 102 out of 104 supporting invariants were superfluous and have been removed [2019-01-14 02:27:59,466 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:27:59,467 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:27:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:59,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:27:59,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:27:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:27:59,703 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:27:59,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 4 states. [2019-01-14 02:27:59,847 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-14 02:27:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:27:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:27:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 02:27:59,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:27:59,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:59,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:27:59,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:59,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:27:59,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:27:59,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2019-01-14 02:27:59,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:27:59,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 15 transitions. [2019-01-14 02:27:59,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:27:59,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:27:59,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-01-14 02:27:59,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:27:59,870 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-14 02:27:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-01-14 02:27:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-14 02:27:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:27:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-14 02:27:59,902 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:27:59,902 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:27:59,902 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:27:59,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-14 02:27:59,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:27:59,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:27:59,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:27:59,904 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:27:59,905 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:27:59,905 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-14 02:27:59,905 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~short15;havoc main_#t~mem12;havoc main_#t~mem14;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-14 02:27:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:27:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:27:59,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:27:59,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:27:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:59,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:27:59,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:27:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash 41888, now seen corresponding path program 1 times [2019-01-14 02:28:00,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:00,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:00,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:00,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash 889571357, now seen corresponding path program 1 times [2019-01-14 02:28:00,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:00,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:00,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:00,616 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-01-14 02:28:01,042 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-14 02:28:02,491 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 183 DAG size of output: 159 [2019-01-14 02:28:04,469 WARN L181 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 156 [2019-01-14 02:28:04,475 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:28:04,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:28:04,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:28:04,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:28:04,476 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:28:04,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:28:04,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:28:04,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:28:04,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig7-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:28:04,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:28:04,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:28:04,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:04,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:08,143 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 179 DAG size of output: 139 [2019-01-14 02:28:09,914 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2019-01-14 02:28:09,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:09,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:09,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:09,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:10,341 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-14 02:28:10,651 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:28:10,870 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-01-14 02:28:11,076 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 02:28:35,979 WARN L181 SmtUtils]: Spent 24.74 s on a formula simplification. DAG size of input: 194 DAG size of output: 194 [2019-01-14 02:28:36,209 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-01-14 02:28:36,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:28:36,274 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:28:36,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:36,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:36,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:36,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:28:36,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:36,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:36,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:36,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:36,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:36,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:36,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:36,393 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:28:36,395 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:28:36,395 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:28:36,397 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:28:36,397 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:28:36,397 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:28:36,397 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-14 02:28:37,356 INFO L297 tatePredicateManager]: 120 out of 124 supporting invariants were superfluous and have been removed [2019-01-14 02:28:37,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:28:37,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:28:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:37,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:28:37,426 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-14 02:28:37,446 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-14 02:28:37,475 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-14 02:28:37,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,522 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-14 02:28:37,550 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-14 02:28:37,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:37,618 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-14 02:28:37,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:37,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:37,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:37,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:37,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:37,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:37,902 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-14 02:28:37,902 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:48, output treesize:20 [2019-01-14 02:28:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:37,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:28:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-14 02:28:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,302 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-14 02:28:38,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,382 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-14 02:28:38,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,429 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-14 02:28:38,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,554 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-14 02:28:38,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,626 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-14 02:28:38,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:28:38,632 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,647 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-14 02:28:38,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:28:38,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,805 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-14 02:28:38,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:28:38,810 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,819 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,842 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-14 02:28:38,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,924 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-14 02:28:38,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 02:28:38,932 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:38,955 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-14 02:28:38,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-14 02:28:38,960 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,968 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:38,976 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-14 02:28:38,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:39,025 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-14 02:28:39,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:39,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:39,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:39,053 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-14 02:28:39,054 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:39,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:39,543 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-14 02:28:39,545 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:40,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:40,344 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-14 02:28:40,345 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:40,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:40,884 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-01-14 02:28:40,885 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-14 02:28:40,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:40,890 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-14 02:28:40,890 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:40,916 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2019-01-14 02:28:41,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,230 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-14 02:28:41,231 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,240 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,325 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-14 02:28:41,331 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:41,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,367 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-14 02:28:41,369 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2019-01-14 02:28:41,447 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:28:41,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,662 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-14 02:28:41,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,666 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-14 02:28:41,667 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,679 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,763 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-14 02:28:41,822 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-14 02:28:41,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,836 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-14 02:28:41,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,899 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-14 02:28:41,901 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,955 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-14 02:28:41,956 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:41,962 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-14 02:28:41,964 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2019-01-14 02:28:42,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 02:28:42,095 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,128 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-14 02:28:42,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:28:42,133 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,142 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,149 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-14 02:28:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,158 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-14 02:28:42,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,171 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-14 02:28:42,172 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,201 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-14 02:28:42,227 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-14 02:28:42,227 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,320 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,332 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-14 02:28:42,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,366 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-14 02:28:42,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,375 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-14 02:28:42,376 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,466 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-14 02:28:42,467 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,576 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-14 02:28:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,587 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-14 02:28:42,588 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,606 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,719 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-14 02:28:42,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,762 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-14 02:28:42,763 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,831 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-14 02:28:42,832 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,856 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:42,895 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-14 02:28:42,943 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-14 02:28:42,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:42,991 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-14 02:28:43,543 WARN L181 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-14 02:28:43,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:43,551 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-14 02:28:43,553 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:43,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 02:28:43,558 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:43,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:43,564 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-14 02:28:43,565 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:44,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:44,510 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-14 02:28:44,511 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:44,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:44,602 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-14 02:28:44,604 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:44,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:44,655 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-14 02:28:44,656 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,526 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-14 02:28:45,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,537 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,550 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-14 02:28:45,551 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:45,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,604 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-14 02:28:45,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,647 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-14 02:28:45,650 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-14 02:28:45,693 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:45,709 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-14 02:28:45,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,780 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-14 02:28:45,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:45,814 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-14 02:28:45,815 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:47,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:47,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:47,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:47,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:47,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:47,134 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-14 02:28:47,135 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2019-01-14 02:28:48,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:48,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:48,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:48,078 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-14 02:28:48,080 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2019-01-14 02:28:49,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:49,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:49,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:49,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:50,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:50,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:50,027 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-14 02:28:50,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:50,035 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-14 02:28:50,036 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:50,163 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:28:51,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:51,641 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-14 02:28:51,642 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:52,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,265 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-14 02:28:52,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,274 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-14 02:28:52,274 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:52,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,388 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-14 02:28:52,390 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 3 xjuncts. [2019-01-14 02:28:52,488 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:28:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,969 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-14 02:28:52,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:52,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,013 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-14 02:28:53,014 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-14 02:28:53,060 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-14 02:28:53,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,083 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-14 02:28:53,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:53,144 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-14 02:28:53,146 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-14 02:28:53,198 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:54,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-14 02:28:54,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,182 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:54,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,186 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:54,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:54,354 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-14 02:28:54,359 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 8 xjuncts. [2019-01-14 02:28:54,765 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:28:55,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-14 02:28:55,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,363 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-14 02:28:55,364 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:55,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,492 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-14 02:28:55,495 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 3 xjuncts. [2019-01-14 02:28:55,597 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:28:55,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,672 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-14 02:28:55,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,680 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-14 02:28:55,680 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:55,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:55,884 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-14 02:28:55,887 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 9 xjuncts. [2019-01-14 02:28:56,075 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:28:56,659 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 18 xjuncts. [2019-01-14 02:28:56,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,712 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-14 02:28:56,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:28:56,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,750 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-14 02:28:56,751 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,915 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-14 02:28:56,917 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2019-01-14 02:28:57,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,292 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-14 02:28:57,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,332 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-14 02:28:57,333 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:57,433 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:28:57,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,768 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-14 02:28:57,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:57,813 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-14 02:28:57,814 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:58,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,352 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-14 02:28:58,355 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 9 xjuncts. [2019-01-14 02:28:58,551 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:28:58,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,784 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-14 02:28:58,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,793 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-14 02:28:58,795 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:58,961 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-14 02:28:58,965 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 9 xjuncts. [2019-01-14 02:28:59,157 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:28:59,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-14 02:28:59,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,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-14 02:28:59,257 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:59,448 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-14 02:28:59,449 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:28:59,456 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 27 xjuncts. [2019-01-14 02:28:59,754 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-01-14 02:29:00,075 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-14 02:29:02,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:02,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2019-01-14 02:29:02,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:02,030 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-14 02:29:02,031 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:02,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:02,057 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-14 02:29:02,061 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-14 02:29:02,061 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:02,069 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:02,083 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-14 02:29:02,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:02,136 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-14 02:29:02,171 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:29:02,171 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:02,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:02,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, 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-14 02:29:02,926 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:03,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:03,480 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-14 02:29:03,481 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,069 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-14 02:29:04,070 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,666 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-14 02:29:04,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,671 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-14 02:29:04,672 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,696 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,095 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-14 02:29:05,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:05,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,140 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-14 02:29:05,142 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 2 xjuncts. [2019-01-14 02:29:05,301 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-14 02:29:05,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:05,722 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-14 02:29:05,723 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:05,774 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,414 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-14 02:29:06,421 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-14 02:29:06,422 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:06,511 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:06,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,702 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-14 02:29:06,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,710 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-14 02:29:06,711 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:06,725 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:06,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,843 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-14 02:29:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,849 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-14 02:29:06,849 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:06,862 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:06,948 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-14 02:29:06,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,985 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-14 02:29:06,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:06,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,003 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-14 02:29:07,004 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 02:29:07,112 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,208 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-14 02:29:07,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:29:07,216 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,238 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,316 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-14 02:29:07,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:29:07,361 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,419 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,491 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-14 02:29:07,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:07,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:29:07,500 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,515 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:07,554 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-14 02:29:08,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,046 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-14 02:29:08,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,052 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-14 02:29:08,053 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,085 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-14 02:29:08,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2019-01-14 02:29:08,092 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,101 INFO L267 ElimStorePlain]: Start of recursive call 128: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,115 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-14 02:29:08,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,170 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-14 02:29:08,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,180 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-14 02:29:08,182 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,318 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-14 02:29:08,319 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,447 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-14 02:29:08,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,457 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-14 02:29:08,458 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,481 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,589 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-14 02:29:08,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:29:08,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,610 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-14 02:29:08,612 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,643 INFO L267 ElimStorePlain]: Start of recursive call 135: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:08,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,758 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-14 02:29:08,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:08,766 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-14 02:29:08,767 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,327 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-14 02:29:09,327 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,362 INFO L267 ElimStorePlain]: Start of recursive call 137: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:29:09,396 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-14 02:29:09,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,437 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-14 02:29:09,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 02:29:09,451 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,564 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-14 02:29:09,565 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,664 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-14 02:29:09,694 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-14 02:29:09,697 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-14 02:29:09,748 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:09,807 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-14 02:29:09,813 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-14 02:29:09,814 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,828 INFO L267 ElimStorePlain]: Start of recursive call 145: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:09,897 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-14 02:29:10,003 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-14 02:29:10,192 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-14 02:29:10,193 INFO L202 ElimStorePlain]: Needed 146 recursive calls to eliminate 3 variables, input treesize:226, output treesize:486 [2019-01-14 02:29:10,449 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-01-14 02:29:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:29:10,451 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-14 02:29:10,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:29:10,521 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-14 02:29:10,523 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-14 02:29:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:29:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:29:10,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:29:10,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:10,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:29:10,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:10,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:29:10,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:10,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-01-14 02:29:10,530 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:29:10,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:29:10,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:29:10,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:29:10,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:29:10,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:29:10,531 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:29:10,531 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:29:10,531 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:29:10,531 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:29:10,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:29:10,531 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:29:10,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:29:10,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:29:10 BoogieIcfgContainer [2019-01-14 02:29:10,541 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:29:10,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:29:10,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:29:10,542 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:29:10,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:27:25" (3/4) ... [2019-01-14 02:29:10,546 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:29:10,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:29:10,547 INFO L168 Benchmark]: Toolchain (without parser) took 106163.12 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 585.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 453.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:10,548 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:10,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:10,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:10,549 INFO L168 Benchmark]: Boogie Preprocessor took 32.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:10,549 INFO L168 Benchmark]: RCFGBuilder took 466.59 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:10,550 INFO L168 Benchmark]: BuchiAutomizer took 104784.63 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 456.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 463.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:10,550 INFO L168 Benchmark]: Witness Printer took 4.97 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:10,558 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 808.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.37 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 32.51 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 466.59 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 104784.63 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 456.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 463.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.97 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 104.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 70.9s. Construction of modules took 0.0s. Büchi inclusion checks took 33.4s. 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...