./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e3ac7e4caefab280af1b902717cbfa5c070462d8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:34:47,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:34:47,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:34:47,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:34:47,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:34:47,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:34:47,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:34:47,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:34:47,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:34:47,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:34:47,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:34:47,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:34:47,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:34:47,359 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:34:47,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:34:47,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:34:47,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:34:47,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:34:47,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:34:47,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:34:47,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:34:47,365 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:34:47,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:34:47,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:34:47,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:34:47,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:34:47,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:34:47,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:34:47,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:34:47,371 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:34:47,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:34:47,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:34:47,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:34:47,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:34:47,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:34:47,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:34:47,374 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 02:34:47,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:34:47,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:34:47,386 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:34:47,386 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:34:47,386 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:34:47,386 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:34:47,386 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:34:47,386 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:34:47,387 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:34:47,387 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:34:47,387 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:34:47,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:34:47,388 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:34:47,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:34:47,388 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:34:47,388 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:34:47,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:34:47,388 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:34:47,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:34:47,389 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:34:47,389 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:34:47,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:34:47,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:34:47,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:34:47,389 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:34:47,390 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:34:47,390 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:34:47,390 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:34:47,390 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:34:47,391 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3ac7e4caefab280af1b902717cbfa5c070462d8 [2018-11-23 02:34:47,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:34:47,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:34:47,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:34:47,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:34:47,432 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:34:47,433 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2018-11-23 02:34:47,479 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/data/66839ed0b/0dc64fe5a9cf471e950ba49e747c392b/FLAG12415f4e8 [2018-11-23 02:34:47,850 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:34:47,850 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2018-11-23 02:34:47,860 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/data/66839ed0b/0dc64fe5a9cf471e950ba49e747c392b/FLAG12415f4e8 [2018-11-23 02:34:48,238 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/data/66839ed0b/0dc64fe5a9cf471e950ba49e747c392b [2018-11-23 02:34:48,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:34:48,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:34:48,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:34:48,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:34:48,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:34:48,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368520c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48, skipping insertion in model container [2018-11-23 02:34:48,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:34:48,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:34:48,470 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:34:48,477 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:34:48,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:34:48,581 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:34:48,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48 WrapperNode [2018-11-23 02:34:48,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:34:48,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:34:48,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:34:48,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:34:48,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:34:48,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:34:48,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:34:48,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:34:48,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... [2018-11-23 02:34:48,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:34:48,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:34:48,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:34:48,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:34:48,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:34:48,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:34:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:34:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:34:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:34:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:34:48,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:34:48,839 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:34:48,839 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 02:34:48,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:48 BoogieIcfgContainer [2018-11-23 02:34:48,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:34:48,840 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:34:48,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:34:48,842 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:34:48,843 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:34:48,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:34:48" (1/3) ... [2018-11-23 02:34:48,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cc6fa26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:34:48, skipping insertion in model container [2018-11-23 02:34:48,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:34:48,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:34:48" (2/3) ... [2018-11-23 02:34:48,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cc6fa26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:34:48, skipping insertion in model container [2018-11-23 02:34:48,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:34:48,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:48" (3/3) ... [2018-11-23 02:34:48,846 INFO L375 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca_true-termination.c.i [2018-11-23 02:34:48,887 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:34:48,887 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:34:48,888 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:34:48,888 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:34:48,888 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:34:48,888 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:34:48,888 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:34:48,888 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:34:48,888 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:34:48,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 02:34:48,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:34:48,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:48,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:48,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:34:48,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:48,915 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:34:48,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 02:34:48,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:34:48,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:48,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:48,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:34:48,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:48,921 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 11#L556-1true [2018-11-23 02:34:48,922 INFO L796 eck$LassoCheckResult]: Loop: 11#L556-1true call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 7#L553-1true assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L553-3true assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 13#L554true assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 8#L554-2true assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 11#L556-1true [2018-11-23 02:34:48,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 02:34:48,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:48,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:48,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:49,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 1 times [2018-11-23 02:34:49,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:49,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:49,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:49,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849170, now seen corresponding path program 1 times [2018-11-23 02:34:49,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:49,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:49,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:49,355 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 02:34:49,573 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-23 02:34:49,650 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:34:49,651 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:34:49,651 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:34:49,651 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:34:49,651 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:34:49,651 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:34:49,651 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:34:49,651 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:34:49,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 02:34:49,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:34:49,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:34:49,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,909 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-11-23 02:34:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:49,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:50,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:50,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:50,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:50,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:50,344 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:34:50,347 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:34:50,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,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 [2018-11-23 02:34:50,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:50,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:50,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,419 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:34:50,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:34:50,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:50,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,425 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:50,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,426 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:50,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,434 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:50,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,436 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:50,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,469 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:50,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,470 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:50,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:50,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:50,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:50,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:50,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:50,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:50,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:50,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:50,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:34:50,507 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:34:50,507 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:34:50,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:34:50,510 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:34:50,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:34:50,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-23 02:34:50,583 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:34:50,591 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:34:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:50,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:50,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:50,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2018-11-23 02:34:50,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:34:50,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:50,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:50,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:50,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 02:34:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:50,837 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 02:34:50,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 6 states. [2018-11-23 02:34:50,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 6 states. Result 45 states and 56 transitions. Complement of second has 14 states. [2018-11-23 02:34:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 02:34:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:34:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 02:34:50,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-23 02:34:50,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:50,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 02:34:50,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:50,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-23 02:34:50,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:50,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2018-11-23 02:34:50,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:34:50,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 29 transitions. [2018-11-23 02:34:50,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 02:34:50,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 02:34:50,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-11-23 02:34:50,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:34:50,976 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-23 02:34:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-11-23 02:34:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 02:34:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 02:34:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-11-23 02:34:50,995 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 02:34:50,995 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-11-23 02:34:50,995 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:34:50,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2018-11-23 02:34:50,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:34:50,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:50,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:50,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:34:50,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:50,997 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 219#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 221#L553-1 assume !main_#t~short9; 222#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 229#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 233#L554-2 [2018-11-23 02:34:50,997 INFO L796 eck$LassoCheckResult]: Loop: 233#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 226#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 231#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 234#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 232#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 233#L554-2 [2018-11-23 02:34:50,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-11-23 02:34:50,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:50,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:50,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:51,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:34:51,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:34:51,029 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:34:51,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 2 times [2018-11-23 02:34:51,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:51,273 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 02:34:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:34:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:34:51,323 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 02:34:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:51,330 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-11-23 02:34:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:34:51,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-11-23 02:34:51,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:34:51,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 22 transitions. [2018-11-23 02:34:51,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 02:34:51,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 02:34:51,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-23 02:34:51,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:34:51,332 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 02:34:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-23 02:34:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 02:34:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 02:34:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-23 02:34:51,334 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 02:34:51,334 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-23 02:34:51,334 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:34:51,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-23 02:34:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:34:51,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:51,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:51,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:34:51,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:51,335 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 262#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 264#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 265#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 272#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 275#L554-2 [2018-11-23 02:34:51,335 INFO L796 eck$LassoCheckResult]: Loop: 275#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 269#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 274#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 277#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 276#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 275#L554-2 [2018-11-23 02:34:51,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-11-23 02:34:51,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:51,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:34:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:51,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 3 times [2018-11-23 02:34:51,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:51,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:51,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:51,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash -304168138, now seen corresponding path program 1 times [2018-11-23 02:34:51,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:51,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:51,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:34:51,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:34:51,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:34:51,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:51,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:51,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:51,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:34:51,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:51,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:51,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:34:51,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 02:34:51,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:34:51,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 02:34:51,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:34:51,668 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,672 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,687 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-11-23 02:34:51,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-11-23 02:34:51,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:34:51,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-23 02:34:51,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 126 [2018-11-23 02:34:51,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 02:34:51,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:51,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-11-23 02:34:51,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-23 02:34:51,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-11-23 02:34:51,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 02:34:51,902 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,909 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:51,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:51,924 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:346, output treesize:46 [2018-11-23 02:34:52,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-23 02:34:52,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 02:34:52,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:52,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 02:34:52,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:52,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-23 02:34:52,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:52,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:52,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:52,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:20 [2018-11-23 02:34:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:52,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:34:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-23 02:34:52,272 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 02:34:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:34:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:34:52,322 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 13 states. [2018-11-23 02:34:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:34:52,778 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-11-23 02:34:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:34:52,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-23 02:34:52,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 02:34:52,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-11-23 02:34:52,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 02:34:52,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 02:34:52,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-23 02:34:52,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:34:52,780 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 02:34:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-23 02:34:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 02:34:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 02:34:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-23 02:34:52,782 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 02:34:52,782 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-23 02:34:52,782 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:34:52,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-23 02:34:52,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-23 02:34:52,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:52,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:52,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:34:52,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:52,784 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 360#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 373#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 379#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 377#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 374#L554-2 [2018-11-23 02:34:52,784 INFO L796 eck$LassoCheckResult]: Loop: 374#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 372#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 366#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 367#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 370#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 374#L554-2 [2018-11-23 02:34:52,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:52,784 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 2 times [2018-11-23 02:34:52,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:52,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:52,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 1 times [2018-11-23 02:34:52,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:52,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:52,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:34:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:52,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:52,810 INFO L82 PathProgramCache]: Analyzing trace with hash -304168136, now seen corresponding path program 1 times [2018-11-23 02:34:52,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:52,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:52,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:53,025 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-23 02:34:53,271 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2018-11-23 02:34:53,333 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:34:53,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:34:53,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:34:53,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:34:53,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:34:53,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:34:53,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:34:53,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:34:53,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 02:34:53,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:34:53,334 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:34:53,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:53,848 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:34:53,848 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:34:53,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:53,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:53,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:53,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:53,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:53,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:53,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:53,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:53,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:53,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:53,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:53,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:53,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:53,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:53,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:53,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:53,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:53,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:53,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:53,855 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:53,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:53,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:53,856 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:53,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:53,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:53,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:53,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:53,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:53,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:53,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:53,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:53,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:53,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:53,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:53,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:53,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:53,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:53,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:53,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:53,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:53,888 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:34:53,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:34:53,894 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:34:53,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:34:53,895 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:34:53,896 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:34:53,896 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-11-23 02:34:53,987 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:34:53,990 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:34:54,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:54,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:54,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:54,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:34:54,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:54,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:54,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:34:54,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:54,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:54,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:54,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:34:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:54,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:54,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2018-11-23 02:34:55,680 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-11-23 02:34:55,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-11-23 02:34:55,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:55,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-11-23 02:34:55,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-11-23 02:34:56,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:34:56,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 02:34:56,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:34:56,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:34:56,397 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,406 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2018-11-23 02:34:56,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-11-23 02:34:56,555 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:34:56,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:34:56,569 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,573 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,578 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2018-11-23 02:34:56,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 75 [2018-11-23 02:34:56,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-23 02:34:56,660 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2018-11-23 02:34:56,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 02:34:56,708 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,715 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-23 02:34:56,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:34:56,753 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,760 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 62 [2018-11-23 02:34:56,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:34:56,797 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,805 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,818 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:34:56,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:56,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:56,869 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-11-23 02:34:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:56,952 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 02:34:56,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-23 02:34:57,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 38 states and 49 transitions. Complement of second has 10 states. [2018-11-23 02:34:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:34:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:34:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 02:34:57,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-23 02:34:57,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:57,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 02:34:57,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:57,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-23 02:34:57,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:57,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. [2018-11-23 02:34:57,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-23 02:34:57,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 44 transitions. [2018-11-23 02:34:57,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 02:34:57,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 02:34:57,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-23 02:34:57,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:34:57,034 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-23 02:34:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-23 02:34:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 02:34:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:34:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-11-23 02:34:57,036 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-23 02:34:57,036 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-23 02:34:57,036 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:34:57,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-11-23 02:34:57,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-23 02:34:57,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:57,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:57,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:34:57,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:57,037 INFO L794 eck$LassoCheckResult]: Stem: 587#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 585#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 586#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 600#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 611#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 607#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 608#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 612#L556-1 [2018-11-23 02:34:57,040 INFO L796 eck$LassoCheckResult]: Loop: 612#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 613#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 609#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 610#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 614#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 612#L556-1 [2018-11-23 02:34:57,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 1 times [2018-11-23 02:34:57,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:57,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:57,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:57,059 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 4 times [2018-11-23 02:34:57,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:57,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:57,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:57,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940577, now seen corresponding path program 1 times [2018-11-23 02:34:57,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:57,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:57,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:34:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:57,292 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 02:34:57,977 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 113 [2018-11-23 02:34:58,150 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-23 02:34:58,153 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:34:58,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:34:58,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:34:58,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:34:58,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:34:58,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:34:58,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:34:58,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:34:58,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 02:34:58,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:34:58,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:34:58,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,384 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-23 02:34:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:34:58,758 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:34:58,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:34:58,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:34:58,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:34:58,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:34:58,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,794 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:58,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,795 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:58,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,836 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:58,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,837 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:58,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,845 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:34:58,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,846 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:34:58,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:34:58,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:34:58,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:34:58,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:34:58,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:34:58,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:34:58,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:34:58,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:34:58,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:34:58,884 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:34:58,884 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 02:34:58,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:34:58,885 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:34:58,885 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:34:58,885 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-23 02:34:58,967 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:34:58,970 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:34:58,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:58,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:58,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:58,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:34:59,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:59,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:59,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:34:59,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:34:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:59,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:59,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2018-11-23 02:34:59,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:34:59,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 02:34:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:59,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:34:59,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-23 02:34:59,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 63 states and 83 transitions. Complement of second has 12 states. [2018-11-23 02:34:59,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:34:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:34:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-23 02:34:59,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 02:34:59,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:59,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 02:34:59,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:59,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-23 02:34:59,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:34:59,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 83 transitions. [2018-11-23 02:34:59,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-23 02:34:59,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 61 states and 81 transitions. [2018-11-23 02:34:59,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 02:34:59,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 02:34:59,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 81 transitions. [2018-11-23 02:34:59,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:34:59,202 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 81 transitions. [2018-11-23 02:34:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 81 transitions. [2018-11-23 02:34:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 02:34:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 02:34:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2018-11-23 02:34:59,206 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 77 transitions. [2018-11-23 02:34:59,206 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 77 transitions. [2018-11-23 02:34:59,206 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:34:59,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 77 transitions. [2018-11-23 02:34:59,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-23 02:34:59,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:34:59,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:34:59,208 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1] [2018-11-23 02:34:59,208 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:34:59,208 INFO L794 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 854#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 855#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 883#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 882#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 881#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 880#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 872#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 869#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 909#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 908#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 871#L554-2 [2018-11-23 02:34:59,208 INFO L796 eck$LassoCheckResult]: Loop: 871#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 912#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 911#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 910#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 870#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 871#L554-2 [2018-11-23 02:34:59,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash -302321094, now seen corresponding path program 1 times [2018-11-23 02:34:59,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:59,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:59,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:59,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:59,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:59,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:34:59,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:34:59,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:34:59,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:34:59,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:59,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:34:59,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:59,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:59,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:34:59,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 02:34:59,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:34:59,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 02:34:59,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:34:59,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,530 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-11-23 02:34:59,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-11-23 02:34:59,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:34:59,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-23 02:34:59,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 124 [2018-11-23 02:34:59,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-11-23 02:34:59,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:34:59,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2018-11-23 02:34:59,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-23 02:34:59,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-11-23 02:34:59,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 02:34:59,736 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,742 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:59,754 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:328, output treesize:46 [2018-11-23 02:34:59,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-23 02:34:59,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-11-23 02:34:59,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:34:59,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:34:59,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:59,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 02:34:59,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:59,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:59,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:34:59,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:22 [2018-11-23 02:34:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:34:59,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:34:59,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-11-23 02:34:59,899 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:34:59,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:34:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 2 times [2018-11-23 02:34:59,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:34:59,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:34:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:59,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:34:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:34:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:34:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,098 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-23 02:35:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:35:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:35:00,137 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. cyclomatic complexity: 25 Second operand 16 states. [2018-11-23 02:35:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:35:00,421 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2018-11-23 02:35:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:35:00,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 91 transitions. [2018-11-23 02:35:00,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 02:35:00,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 91 transitions. [2018-11-23 02:35:00,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-23 02:35:00,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-23 02:35:00,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 91 transitions. [2018-11-23 02:35:00,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:00,424 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-23 02:35:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 91 transitions. [2018-11-23 02:35:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-23 02:35:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 02:35:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-11-23 02:35:00,428 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-11-23 02:35:00,428 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-11-23 02:35:00,428 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:35:00,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 87 transitions. [2018-11-23 02:35:00,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-23 02:35:00,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:00,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:00,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1] [2018-11-23 02:35:00,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:00,429 INFO L794 eck$LassoCheckResult]: Stem: 1046#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1044#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1045#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1070#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1071#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1065#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1066#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1082#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1074#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1068#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1069#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1084#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1075#L556-1 [2018-11-23 02:35:00,429 INFO L796 eck$LassoCheckResult]: Loop: 1075#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1076#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1086#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1085#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1083#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 1075#L556-1 [2018-11-23 02:35:00,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940579, now seen corresponding path program 2 times [2018-11-23 02:35:00,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:00,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:00,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:00,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:00,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 5 times [2018-11-23 02:35:00,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:00,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:00,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:00,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:00,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1666915826, now seen corresponding path program 2 times [2018-11-23 02:35:00,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:00,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:00,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:00,651 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 02:35:03,608 WARN L180 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 198 DAG size of output: 159 [2018-11-23 02:35:04,281 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-23 02:35:04,284 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:35:04,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:35:04,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:35:04,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:35:04,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:35:04,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:35:04,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:35:04,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:35:04,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-23 02:35:04,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:35:04,285 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:35:04,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,869 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2018-11-23 02:35:04,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:04,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:05,188 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:35:05,188 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:35:05,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,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 [2018-11-23 02:35:05,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:05,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:05,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:05,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,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 [2018-11-23 02:35:05,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,238 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:05,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,239 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:05,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,242 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:05,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,242 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:05,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,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 [2018-11-23 02:35:05,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,248 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:05,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,248 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:05,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:05,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:05,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:05,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:05,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:05,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:05,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:05,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:05,260 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:35:05,269 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 02:35:05,269 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 02:35:05,270 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:35:05,270 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:35:05,271 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:35:05,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-11-23 02:35:05,408 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:35:05,410 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:35:05,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:05,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:05,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:05,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:05,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:05,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:05,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2018-11-23 02:35:05,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:05,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 02:35:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:05,620 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:35:05,620 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-23 02:35:05,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 92 states and 116 transitions. Complement of second has 12 states. [2018-11-23 02:35:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:35:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-23 02:35:05,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 02:35:05,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:05,693 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:35:05,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:05,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:05,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:05,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:05,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:05,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:05,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2018-11-23 02:35:05,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:05,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 02:35:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:05,847 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:35:05,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-23 02:35:05,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 92 states and 116 transitions. Complement of second has 12 states. [2018-11-23 02:35:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:35:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-23 02:35:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 02:35:05,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:05,925 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:35:05,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:05,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:05,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:05,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:05,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:05,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:05,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:06,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:06,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2018-11-23 02:35:06,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:06,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:06,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:06,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:06,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 02:35:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:06,076 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:35:06,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-23 02:35:06,145 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 105 states and 132 transitions. Complement of second has 11 states. [2018-11-23 02:35:06,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:35:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-23 02:35:06,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 02:35:06,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:06,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-23 02:35:06,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:06,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-23 02:35:06,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:06,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2018-11-23 02:35:06,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-11-23 02:35:06,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 83 states and 105 transitions. [2018-11-23 02:35:06,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 02:35:06,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-23 02:35:06,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 105 transitions. [2018-11-23 02:35:06,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:06,152 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2018-11-23 02:35:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 105 transitions. [2018-11-23 02:35:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 38. [2018-11-23 02:35:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 02:35:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 02:35:06,154 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 02:35:06,154 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 02:35:06,154 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:35:06,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-11-23 02:35:06,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 02:35:06,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:06,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:06,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:35:06,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:06,155 INFO L794 eck$LassoCheckResult]: Stem: 1738#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1736#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1737#L556-1 [2018-11-23 02:35:06,156 INFO L796 eck$LassoCheckResult]: Loop: 1737#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1742#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1743#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1746#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1739#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1737#L556-1 [2018-11-23 02:35:06,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 02:35:06,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:06,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:06,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:06,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:06,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:06,163 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 1 times [2018-11-23 02:35:06,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:06,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:06,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 3 times [2018-11-23 02:35:06,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:06,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:06,357 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-11-23 02:35:06,517 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:35:06,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:35:06,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:35:06,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:35:06,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:35:06,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:35:06,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:35:06,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:35:06,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-23 02:35:06,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:35:06,518 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:35:06,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:06,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:07,013 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:35:07,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:35:07,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:07,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:07,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:07,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,043 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:07,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,044 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:07,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,055 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:07,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,055 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:07,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:07,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:07,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:07,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:07,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:07,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:07,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:07,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:07,068 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:35:07,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:35:07,070 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:35:07,070 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:35:07,071 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:35:07,071 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:35:07,071 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2018-11-23 02:35:07,220 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:35:07,222 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:35:07,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:07,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:07,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:07,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 02:35:07,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:07,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:07,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:07,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:07,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-23 02:35:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:07,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 02:35:07,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 02:35:07,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 58 states and 74 transitions. Complement of second has 9 states. [2018-11-23 02:35:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 02:35:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-11-23 02:35:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-23 02:35:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 02:35:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:07,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-23 02:35:07,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:07,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2018-11-23 02:35:07,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 02:35:07,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 52 states and 67 transitions. [2018-11-23 02:35:07,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 02:35:07,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 02:35:07,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2018-11-23 02:35:07,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:07,348 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2018-11-23 02:35:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2018-11-23 02:35:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-11-23 02:35:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 02:35:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-11-23 02:35:07,350 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 02:35:07,350 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-11-23 02:35:07,350 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 02:35:07,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2018-11-23 02:35:07,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 02:35:07,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:07,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:07,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:35:07,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:07,351 INFO L794 eck$LassoCheckResult]: Stem: 1985#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1983#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 1984#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2003#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2002#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2001#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2000#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1991#L556-1 [2018-11-23 02:35:07,351 INFO L796 eck$LassoCheckResult]: Loop: 1991#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1986#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1987#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1994#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 1990#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1991#L556-1 [2018-11-23 02:35:07,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849234, now seen corresponding path program 2 times [2018-11-23 02:35:07,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:07,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:07,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:07,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 2 times [2018-11-23 02:35:07,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:07,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:07,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:07,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:07,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:07,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:07,378 INFO L82 PathProgramCache]: Analyzing trace with hash -782019355, now seen corresponding path program 1 times [2018-11-23 02:35:07,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:07,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:07,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:07,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:07,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:07,576 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-11-23 02:35:08,228 WARN L180 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2018-11-23 02:35:08,399 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 02:35:08,402 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:35:08,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:35:08,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:35:08,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:35:08,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:35:08,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:35:08,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:35:08,403 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:35:08,403 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-23 02:35:08,403 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:35:08,403 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:35:08,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:08,944 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:35:08,944 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:35:08,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:08,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:08,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:08,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:08,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:08,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:08,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:08,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:08,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:08,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:08,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:08,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:08,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:08,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:08,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:08,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:08,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:08,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:08,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:08,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:08,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:08,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:08,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:08,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:08,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:08,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:08,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:08,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:08,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:08,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:08,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:08,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:08,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:08,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:08,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:08,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:08,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:08,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:08,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:08,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:08,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:08,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:08,954 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:35:08,958 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:35:08,958 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:35:08,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:35:08,959 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:35:08,959 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:35:08,959 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-23 02:35:09,037 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:35:09,040 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:35:09,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:09,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:09,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:09,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:09,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:09,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:09,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 02:35:09,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:09,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-23 02:35:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:09,152 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 02:35:09,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-23 02:35:09,211 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 119 states and 148 transitions. Complement of second has 10 states. [2018-11-23 02:35:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:35:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-23 02:35:09,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-23 02:35:09,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:09,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-23 02:35:09,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:09,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-23 02:35:09,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:09,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 148 transitions. [2018-11-23 02:35:09,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 02:35:09,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 94 states and 119 transitions. [2018-11-23 02:35:09,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-23 02:35:09,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-23 02:35:09,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2018-11-23 02:35:09,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:09,217 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-11-23 02:35:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2018-11-23 02:35:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-11-23 02:35:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 02:35:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2018-11-23 02:35:09,220 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-11-23 02:35:09,221 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-11-23 02:35:09,221 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 02:35:09,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 94 transitions. [2018-11-23 02:35:09,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 02:35:09,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:09,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:09,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 02:35:09,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:09,222 INFO L794 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2318#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2319#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2327#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2328#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2330#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2323#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2324#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2325#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2326#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2329#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2333#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2336#L556-1 [2018-11-23 02:35:09,222 INFO L796 eck$LassoCheckResult]: Loop: 2336#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2361#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2371#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2368#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2366#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2336#L556-1 [2018-11-23 02:35:09,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940641, now seen corresponding path program 2 times [2018-11-23 02:35:09,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:09,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:35:09,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:35:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:35:09,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:35:09,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:35:09,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:09,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:09,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:09,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 02:35:09,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:35:09,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 02:35:09,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 02:35:09,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,564 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-11-23 02:35:09,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-11-23 02:35:09,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:09,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-23 02:35:09,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 128 [2018-11-23 02:35:09,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 02:35:09,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:09,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2018-11-23 02:35:09,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-23 02:35:09,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-23 02:35:09,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-23 02:35:09,759 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:09,778 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:330, output treesize:46 [2018-11-23 02:35:09,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-23 02:35:09,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 02:35:09,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 02:35:09,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:09,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 02:35:09,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:09,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:09,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:09,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:14 [2018-11-23 02:35:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:09,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:35:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 02:35:09,953 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:35:09,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 3 times [2018-11-23 02:35:09,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:09,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:10,131 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-11-23 02:35:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:35:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:35:10,183 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. cyclomatic complexity: 29 Second operand 16 states. [2018-11-23 02:35:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:35:10,583 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-23 02:35:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:35:10,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 123 transitions. [2018-11-23 02:35:10,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2018-11-23 02:35:10,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 98 states and 119 transitions. [2018-11-23 02:35:10,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-23 02:35:10,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-23 02:35:10,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 119 transitions. [2018-11-23 02:35:10,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:10,585 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-23 02:35:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 119 transitions. [2018-11-23 02:35:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2018-11-23 02:35:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 02:35:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2018-11-23 02:35:10,589 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2018-11-23 02:35:10,589 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2018-11-23 02:35:10,589 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 02:35:10,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 89 transitions. [2018-11-23 02:35:10,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-23 02:35:10,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:10,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:10,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-11-23 02:35:10,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-11-23 02:35:10,590 INFO L794 eck$LassoCheckResult]: Stem: 2555#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2553#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2554#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2582#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2605#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2594#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2591#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2590#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2588#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2587#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2586#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2584#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 2585#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2578#L553-1 [2018-11-23 02:35:10,590 INFO L796 eck$LassoCheckResult]: Loop: 2578#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2576#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2577#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2592#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2593#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2588#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2587#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2586#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2584#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 2585#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2578#L553-1 [2018-11-23 02:35:10,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:10,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1958416954, now seen corresponding path program 3 times [2018-11-23 02:35:10,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:10,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:10,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:10,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:10,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 480749795, now seen corresponding path program 1 times [2018-11-23 02:35:10,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:10,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:10,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:10,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:10,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1335499672, now seen corresponding path program 4 times [2018-11-23 02:35:10,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:10,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:10,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:10,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:35:10,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:35:10,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_384d6d5a-170f-4225-a3d3-213bb7e46147/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:35:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:35:10,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:35:10,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:35:10,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:10,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:10,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:10,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:10,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:10,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:10,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:10,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:10,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:10,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-23 02:35:10,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-11-23 02:35:10,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:10,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:10,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:10,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:10,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-23 02:35:11,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 126 [2018-11-23 02:35:11,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-23 02:35:11,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:11,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 86 [2018-11-23 02:35:11,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-11-23 02:35:11,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-23 02:35:11,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-23 02:35:11,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,102 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:11,118 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:330, output treesize:46 [2018-11-23 02:35:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 02:35:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:35:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-23 02:35:12,039 WARN L180 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2018-11-23 02:35:12,254 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-23 02:35:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:35:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:35:12,255 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. cyclomatic complexity: 26 Second operand 17 states. [2018-11-23 02:35:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:35:12,620 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-23 02:35:12,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 02:35:12,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 114 transitions. [2018-11-23 02:35:12,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-23 02:35:12,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 102 transitions. [2018-11-23 02:35:12,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 02:35:12,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:35:12,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 102 transitions. [2018-11-23 02:35:12,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:12,623 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 102 transitions. [2018-11-23 02:35:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 102 transitions. [2018-11-23 02:35:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2018-11-23 02:35:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 02:35:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-11-23 02:35:12,625 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-23 02:35:12,625 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-23 02:35:12,625 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 02:35:12,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2018-11-23 02:35:12,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 02:35:12,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:12,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:12,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-23 02:35:12,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-23 02:35:12,626 INFO L794 eck$LassoCheckResult]: Stem: 2832#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2830#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 2831#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2860#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2858#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2855#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2856#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2873#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2847#L553-1 [2018-11-23 02:35:12,626 INFO L796 eck$LassoCheckResult]: Loop: 2847#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2885#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2884#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 2880#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 2844#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2833#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2834#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 2841#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 2848#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2838#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2847#L553-1 [2018-11-23 02:35:12,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash 177751413, now seen corresponding path program 3 times [2018-11-23 02:35:12,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:12,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:12,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:12,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:12,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:12,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1294255583, now seen corresponding path program 1 times [2018-11-23 02:35:12,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:12,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:12,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:12,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:12,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:12,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2067938965, now seen corresponding path program 1 times [2018-11-23 02:35:12,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:12,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:12,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:13,562 WARN L180 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2018-11-23 02:35:14,634 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2018-11-23 02:35:15,297 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 131 [2018-11-23 02:35:17,689 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-23 02:35:17,693 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:35:17,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:35:17,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:35:17,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:35:17,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:35:17,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:35:17,693 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:35:17,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:35:17,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration12_Lasso [2018-11-23 02:35:17,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:35:17,694 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:35:17,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:17,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,190 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-23 02:35:18,266 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 02:35:18,475 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-11-23 02:35:18,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:18,876 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:35:18,876 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:35:18,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:18,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:18,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:18,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:18,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:18,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:18,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:18,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:18,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:18,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,896 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:18,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,897 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:18,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:18,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:18,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:18,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:18,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,903 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:18,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:18,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,904 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:18,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:18,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:18,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:18,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:18,907 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:18,907 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:35:18,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:18,911 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 02:35:18,911 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 02:35:18,983 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:35:19,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:35:19,002 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:35:19,002 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:35:19,003 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 02:35:19,003 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:35:19,003 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2018-11-23 02:35:19,116 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:35:19,119 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:35:19,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:19,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:19,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:19,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:19,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:19,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:19,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:19,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:19,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:19,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:19,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:19,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:19,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 02:35:19,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:19,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:19,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:19,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:19,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 02:35:19,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2018-11-23 02:35:20,545 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2018-11-23 02:35:20,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-11-23 02:35:20,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:20,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-11-23 02:35:20,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:20,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2018-11-23 02:35:20,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 02:35:21,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2018-11-23 02:35:21,247 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:21,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:21,263 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,268 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 83 [2018-11-23 02:35:21,449 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 76 treesize of output 75 [2018-11-23 02:35:21,449 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,499 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 61 treesize of output 62 [2018-11-23 02:35:21,499 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2018-11-23 02:35:21,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-11-23 02:35:21,545 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,551 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-23 02:35:21,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:21,587 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,592 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2018-11-23 02:35:21,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2018-11-23 02:35:21,624 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,631 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,645 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:21,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-23 02:35:21,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-11-23 02:35:21,656 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:21,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:21,670 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,673 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,678 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,713 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2018-11-23 02:35:21,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2018-11-23 02:35:21,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2018-11-23 02:35:21,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:21,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2018-11-23 02:35:21,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 138 [2018-11-23 02:35:23,323 WARN L180 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2018-11-23 02:35:23,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2018-11-23 02:35:23,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 108 [2018-11-23 02:35:23,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2018-11-23 02:35:23,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,743 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 87 treesize of output 79 [2018-11-23 02:35:23,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2018-11-23 02:35:23,746 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,760 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 52 [2018-11-23 02:35:23,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:23,762 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,768 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,773 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 92 [2018-11-23 02:35:23,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 99 [2018-11-23 02:35:23,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:23,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,950 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:35:23,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:23,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 138 [2018-11-23 02:35:23,952 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 128 [2018-11-23 02:35:24,024 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-11-23 02:35:24,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 02:35:24,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-11-23 02:35:24,132 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,140 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-11-23 02:35:24,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-11-23 02:35:24,213 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,223 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2018-11-23 02:35:24,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 88 [2018-11-23 02:35:24,236 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,245 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,293 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:35:24,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2018-11-23 02:35:24,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-11-23 02:35:24,365 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-11-23 02:35:24,417 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-11-23 02:35:24,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:24,464 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,470 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2018-11-23 02:35:24,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-11-23 02:35:24,511 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,519 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 02:35:24,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-11-23 02:35:24,554 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,562 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,582 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:24,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-11-23 02:35:24,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:35:24,591 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 02:35:24,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 02:35:24,619 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,624 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,631 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:24,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:24,660 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2018-11-23 02:35:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:24,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-23 02:35:24,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-23 02:35:24,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 144 states and 171 transitions. Complement of second has 16 states. [2018-11-23 02:35:24,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 02:35:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2018-11-23 02:35:24,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-23 02:35:24,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:24,769 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:35:24,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:24,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:24,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:24,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:24,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:24,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:24,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:24,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 02:35:24,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:24,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:24,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 02:35:24,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2018-11-23 02:35:26,051 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2018-11-23 02:35:26,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-11-23 02:35:26,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:26,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-11-23 02:35:26,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:26,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2018-11-23 02:35:26,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:26,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 02:35:26,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2018-11-23 02:35:26,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:26,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:26,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:26,821 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:26,826 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:26,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 83 [2018-11-23 02:35:27,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-11-23 02:35:27,012 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,062 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 61 treesize of output 62 [2018-11-23 02:35:27,062 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2018-11-23 02:35:27,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-11-23 02:35:27,108 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,115 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2018-11-23 02:35:27,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2018-11-23 02:35:27,154 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,163 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-23 02:35:27,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:27,188 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,193 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,205 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:27,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-23 02:35:27,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-11-23 02:35:27,214 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:27,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:27,228 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,232 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,236 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,276 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2018-11-23 02:35:27,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2018-11-23 02:35:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2018-11-23 02:35:27,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:27,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2018-11-23 02:35:27,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 138 [2018-11-23 02:35:28,865 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2018-11-23 02:35:28,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:28,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 101 [2018-11-23 02:35:28,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:28,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:28,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 112 [2018-11-23 02:35:28,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 87 [2018-11-23 02:35:29,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 92 [2018-11-23 02:35:29,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,280 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:35:29,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 146 [2018-11-23 02:35:29,282 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 91 [2018-11-23 02:35:29,353 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 128 [2018-11-23 02:35:29,426 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-23 02:35:29,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2018-11-23 02:35:29,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 88 [2018-11-23 02:35:29,533 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,543 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-11-23 02:35:29,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-11-23 02:35:29,553 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,564 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 02:35:29,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-23 02:35:29,622 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,632 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,698 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:35:29,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-11-23 02:35:29,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:35:29,865 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 02:35:29,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 02:35:29,880 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,884 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,889 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-11-23 02:35:29,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:29,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-11-23 02:35:29,902 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 02:35:29,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:29,921 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,926 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:29,931 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2018-11-23 02:35:30,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2018-11-23 02:35:30,007 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:30,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:30,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 79 [2018-11-23 02:35:30,057 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2018-11-23 02:35:30,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-11-23 02:35:30,102 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,109 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-11-23 02:35:30,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:30,154 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,164 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-11-23 02:35:30,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:30,194 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,202 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,219 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:30,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:30,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:30,248 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2018-11-23 02:35:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:30,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-23 02:35:30,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-23 02:35:30,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 149 states and 178 transitions. Complement of second has 18 states. [2018-11-23 02:35:30,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 02:35:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-11-23 02:35:30,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-23 02:35:30,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:30,376 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:35:30,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:30,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:30,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:30,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:30,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:30,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:30,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:30,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:30,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:30,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 02:35:30,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:35:30,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:30,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 02:35:30,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 131 [2018-11-23 02:35:32,183 WARN L180 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2018-11-23 02:35:32,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-11-23 02:35:32,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-11-23 02:35:32,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2018-11-23 02:35:32,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2018-11-23 02:35:32,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-23 02:35:32,920 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-23 02:35:32,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:32,934 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,938 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,943 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-23 02:35:32,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-11-23 02:35:32,952 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:32,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:32,965 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,969 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:32,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 02:35:33,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2018-11-23 02:35:33,057 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:33,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:33,072 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,078 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,081 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,103 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2018-11-23 02:35:33,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2018-11-23 02:35:33,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2018-11-23 02:35:33,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:33,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2018-11-23 02:35:33,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 249 treesize of output 138 [2018-11-23 02:35:35,396 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2018-11-23 02:35:35,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2018-11-23 02:35:35,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:35,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:35,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 108 [2018-11-23 02:35:35,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:35,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:35,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2018-11-23 02:35:35,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:35,938 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 87 treesize of output 79 [2018-11-23 02:35:35,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2018-11-23 02:35:35,941 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:35,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 52 [2018-11-23 02:35:35,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:35,960 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:35,966 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:35,971 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:36,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 83 [2018-11-23 02:35:36,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:35:36,095 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 02:35:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 02:35:36,111 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,116 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,121 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2018-11-23 02:35:36,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:36,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:36,147 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 74 treesize of output 87 [2018-11-23 02:35:36,148 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2018-11-23 02:35:36,214 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-11-23 02:35:36,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-11-23 02:35:36,274 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,283 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 66 [2018-11-23 02:35:36,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-11-23 02:35:36,337 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,347 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-11-23 02:35:36,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:36,383 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,391 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,406 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:36,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:36,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:36,453 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2018-11-23 02:35:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:36,474 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-23 02:35:36,474 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-23 02:35:36,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 153 states and 180 transitions. Complement of second has 23 states. [2018-11-23 02:35:36,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 02:35:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-23 02:35:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-23 02:35:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 18 letters. Loop has 10 letters. [2018-11-23 02:35:36,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:36,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 20 letters. [2018-11-23 02:35:36,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:36,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 180 transitions. [2018-11-23 02:35:36,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 02:35:36,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 100 states and 124 transitions. [2018-11-23 02:35:36,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 02:35:36,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 02:35:36,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 124 transitions. [2018-11-23 02:35:36,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:36,583 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2018-11-23 02:35:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 124 transitions. [2018-11-23 02:35:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 64. [2018-11-23 02:35:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 02:35:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-11-23 02:35:36,585 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-23 02:35:36,585 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-23 02:35:36,585 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 02:35:36,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2018-11-23 02:35:36,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 02:35:36,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:36,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:36,587 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 02:35:36,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:36,587 INFO L794 eck$LassoCheckResult]: Stem: 3713#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3711#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 3712#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3741#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3739#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3737#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 3736#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 3724#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3726#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3746#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3745#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 3728#L554-2 [2018-11-23 02:35:36,588 INFO L796 eck$LassoCheckResult]: Loop: 3728#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 3730#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3747#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3721#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 3722#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 3728#L554-2 [2018-11-23 02:35:36,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash -302321096, now seen corresponding path program 3 times [2018-11-23 02:35:36,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:36,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:35:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:36,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 3 times [2018-11-23 02:35:36,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:36,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:36,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:36,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:36,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash 337347019, now seen corresponding path program 2 times [2018-11-23 02:35:36,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:36,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:36,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:36,889 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-23 02:35:37,708 WARN L180 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 133 [2018-11-23 02:35:37,867 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-23 02:35:37,870 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:35:37,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:35:37,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:35:37,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:35:37,871 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:35:37,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:35:37,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:35:37,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:35:37,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration13_Lasso [2018-11-23 02:35:37,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:35:37,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:35:37,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:37,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:38,136 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-11-23 02:35:38,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:38,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:38,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:38,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:38,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:38,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:35:38,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:35:38,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,537 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:35:38,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,538 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:35:38,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:38,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:38,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:38,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,580 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:38,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,581 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:38,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,586 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:38,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,587 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:38,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,589 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:38,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,590 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:38,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:38,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:38,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:38,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:38,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:38,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:38,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:38,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:38,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:35:38,624 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:35:38,624 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:35:38,625 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:35:38,625 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:35:38,626 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:35:38,626 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 Supporting invariants [] [2018-11-23 02:35:38,775 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:35:38,778 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:35:38,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:38,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:38,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:38,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:38,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:38,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:38,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:38,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:38,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:38,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:38,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:38,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:39,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2018-11-23 02:35:40,488 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-11-23 02:35:40,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-23 02:35:40,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:40,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-23 02:35:40,850 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:40,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-11-23 02:35:40,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:41,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-23 02:35:41,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 02:35:41,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:41,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:41,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,128 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,133 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-11-23 02:35:41,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-23 02:35:41,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-23 02:35:41,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:41,155 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,158 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,163 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:35:41,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 02:35:41,244 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:41,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:41,260 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,265 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,269 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:41,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:41,287 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-11-23 02:35:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:41,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 02:35:41,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26 Second operand 6 states. [2018-11-23 02:35:41,417 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26. Second operand 6 states. Result 99 states and 122 transitions. Complement of second has 10 states. [2018-11-23 02:35:41,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:35:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 02:35:41,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 02:35:41,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:41,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 02:35:41,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:41,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-23 02:35:41,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:41,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-23 02:35:41,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 02:35:41,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 98 transitions. [2018-11-23 02:35:41,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 02:35:41,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 02:35:41,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 98 transitions. [2018-11-23 02:35:41,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:41,420 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-11-23 02:35:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 98 transitions. [2018-11-23 02:35:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-11-23 02:35:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 02:35:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2018-11-23 02:35:41,423 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2018-11-23 02:35:41,423 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2018-11-23 02:35:41,423 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 02:35:41,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2018-11-23 02:35:41,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 02:35:41,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:41,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:41,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-11-23 02:35:41,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:41,424 INFO L794 eck$LassoCheckResult]: Stem: 4057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4055#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 4056#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4085#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4083#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4073#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4074#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4069#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4070#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4061#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4068#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4075#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4098#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4090#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4096#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4081#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4077#L554-2 [2018-11-23 02:35:41,424 INFO L796 eck$LassoCheckResult]: Loop: 4077#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 4078#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4097#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4066#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4067#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4077#L554-2 [2018-11-23 02:35:41,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash 339194059, now seen corresponding path program 4 times [2018-11-23 02:35:41,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:41,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:41,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:41,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 4 times [2018-11-23 02:35:41,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:41,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:41,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:41,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1493309672, now seen corresponding path program 3 times [2018-11-23 02:35:41,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:41,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:41,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:41,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:41,710 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-23 02:35:45,869 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 231 DAG size of output: 176 [2018-11-23 02:35:46,276 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-23 02:35:46,280 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:35:46,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:35:46,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:35:46,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:35:46,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:35:46,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:35:46,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:35:46,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:35:46,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration14_Lasso [2018-11-23 02:35:46,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:35:46,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:35:46,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:46,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:35:48,254 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:35:48,254 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:35:48,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,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 [2018-11-23 02:35:48,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:35:48,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:35:48,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:35:48,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,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 [2018-11-23 02:35:48,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,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 [2018-11-23 02:35:48,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,281 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:48,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,281 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:48,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,293 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:48,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,294 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:48,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,296 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:35:48,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,297 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:35:48,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:35:48,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:35:48,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:35:48,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:35:48,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:35:48,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:35:48,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:35:48,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:35:48,304 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:35:48,308 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:35:48,308 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:35:48,308 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:35:48,309 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:35:48,309 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:35:48,309 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9 Supporting invariants [] [2018-11-23 02:35:48,449 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:35:48,452 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:35:48,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:48,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:48,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:48,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:48,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:48,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:48,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:48,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:48,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:48,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:48,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:48,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:48,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2018-11-23 02:35:50,484 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-11-23 02:35:50,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-23 02:35:50,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:50,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-11-23 02:35:50,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:50,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-23 02:35:50,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:35:51,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 02:35:51,301 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:51,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:51,316 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-23 02:35:51,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 02:35:51,493 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:51,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:51,506 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,510 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,515 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2018-11-23 02:35:51,534 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 59 treesize of output 58 [2018-11-23 02:35:51,534 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-11-23 02:35:51,573 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2018-11-23 02:35:51,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 02:35:51,614 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,620 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 02:35:51,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:51,645 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,650 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,661 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:51,701 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-11-23 02:35:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:51,771 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 02:35:51,771 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2018-11-23 02:35:51,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 87 states and 108 transitions. Complement of second has 10 states. [2018-11-23 02:35:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:35:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 02:35:51,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 02:35:51,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:51,839 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:35:51,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:51,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:51,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:51,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:51,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:51,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:51,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:51,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:51,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:51,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:51,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2018-11-23 02:35:53,318 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-11-23 02:35:53,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-23 02:35:53,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:53,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-11-23 02:35:53,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:53,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-23 02:35:53,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:53,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:35:53,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 02:35:53,912 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:53,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:53,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:53,927 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:53,932 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:53,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-23 02:35:54,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 02:35:54,070 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:54,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:54,083 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,087 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,091 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2018-11-23 02:35:54,110 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 59 treesize of output 58 [2018-11-23 02:35:54,110 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-11-23 02:35:54,150 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-23 02:35:54,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:54,187 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,194 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2018-11-23 02:35:54,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 02:35:54,228 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,234 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 02:35:54,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:54,258 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,264 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,271 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:54,304 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-11-23 02:35:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:54,374 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 02:35:54,374 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2018-11-23 02:35:54,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 87 states and 108 transitions. Complement of second has 10 states. [2018-11-23 02:35:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:35:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-23 02:35:54,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 02:35:54,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:54,444 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:35:54,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:54,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:54,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:54,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:35:54,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:54,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:35:54,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:35:54,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:54,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:35:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:35:54,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:35:54,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 124 [2018-11-23 02:35:56,254 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-11-23 02:35:56,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-23 02:35:56,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:56,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-23 02:35:56,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:56,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-11-23 02:35:56,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:56,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 82 [2018-11-23 02:35:56,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-11-23 02:35:56,916 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:56,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-11-23 02:35:56,968 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,010 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:35:57,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 92 [2018-11-23 02:35:57,011 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-23 02:35:57,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:57,056 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,062 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 74 [2018-11-23 02:35:57,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:35:57,104 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,112 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 02:35:57,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:35:57,146 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,152 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:57,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2018-11-23 02:35:57,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-11-23 02:35:57,175 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-23 02:35:57,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 02:35:57,190 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,194 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,199 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,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, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2018-11-23 02:35:57,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 53 [2018-11-23 02:35:57,228 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 02:35:57,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-23 02:35:57,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:57,279 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,289 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 69 [2018-11-23 02:35:57,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:57,300 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,307 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2018-11-23 02:35:57,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:57,316 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,324 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,345 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 02:35:57,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:35:57,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 02:35:57,455 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-11-23 02:35:57,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 02:35:57,475 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,486 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,490 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:35:57,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:35:57,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:35:57,513 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-11-23 02:35:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:35:57,578 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 02:35:57,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2018-11-23 02:35:57,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25. Second operand 6 states. Result 76 states and 97 transitions. Complement of second has 9 states. [2018-11-23 02:35:57,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 02:35:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:35:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-23 02:35:57,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 02:35:57,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:57,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-23 02:35:57,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:57,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-23 02:35:57,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:35:57,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2018-11-23 02:35:57,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:35:57,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 50 states and 62 transitions. [2018-11-23 02:35:57,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 02:35:57,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 02:35:57,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2018-11-23 02:35:57,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:35:57,645 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-11-23 02:35:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2018-11-23 02:35:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-23 02:35:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 02:35:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 02:35:57,647 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 02:35:57,647 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 02:35:57,647 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 02:35:57,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2018-11-23 02:35:57,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 02:35:57,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:35:57,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:35:57,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1] [2018-11-23 02:35:57,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 02:35:57,648 INFO L794 eck$LassoCheckResult]: Stem: 4729#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4727#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 4728#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4742#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4769#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4768#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4767#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4765#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4743#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4764#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4763#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4762#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 4756#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4761#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4760#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4758#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 4755#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4750#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4749#L553-1 [2018-11-23 02:35:57,648 INFO L796 eck$LassoCheckResult]: Loop: 4749#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4738#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;havoc main_#t~short9;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 4739#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem11;havoc main_#t~mem10;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 4734#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem21;havoc main_#t~mem20;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4735#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4749#L553-1 [2018-11-23 02:35:57,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1640222317, now seen corresponding path program 4 times [2018-11-23 02:35:57,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:57,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:57,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:57,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:57,678 INFO L82 PathProgramCache]: Analyzing trace with hash 38421686, now seen corresponding path program 4 times [2018-11-23 02:35:57,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:57,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:57,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:57,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:57,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:57,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:35:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2144846236, now seen corresponding path program 5 times [2018-11-23 02:35:57,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:35:57,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:35:57,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:57,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:35:57,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:35:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:35:57,934 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-23 02:35:58,246 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2018-11-23 02:36:11,385 WARN L180 SmtUtils]: Spent 13.14 s on a formula simplification. DAG size of input: 267 DAG size of output: 214 [2018-11-23 02:36:34,262 WARN L180 SmtUtils]: Spent 22.87 s on a formula simplification. DAG size of input: 154 DAG size of output: 154 [2018-11-23 02:36:34,266 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:36:34,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:36:34,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:36:34,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:36:34,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:36:34,267 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:36:34,267 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:36:34,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:36:34,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration15_Lasso [2018-11-23 02:36:34,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:36:34,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:36:34,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:34,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:59,488 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-23 02:36:59,710 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-11-23 02:36:59,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:59,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:36:59,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:37:00,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:37:00,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:37:00,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,150 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:37:00,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:37:00,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,153 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 02:37:00,153 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 02:37:00,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:37:00,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,249 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:37:00,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,249 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:37:00,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,252 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:37:00,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,253 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:37:00,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,255 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:37:00,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,256 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:37:00,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:37:00,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:37:00,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:37:00,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,263 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 02:37:00,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,264 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,265 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 02:37:00,265 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 02:37:00,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,267 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,268 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,269 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,269 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,271 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,272 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,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 [2018-11-23 02:37:00,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,273 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 02:37:00,274 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 02:37:00,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,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 [2018-11-23 02:37:00,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,275 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,275 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,277 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,277 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,278 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,278 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,280 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,280 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 02:37:00,280 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 02:37:00,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,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 [2018-11-23 02:37:00,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,284 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,284 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,285 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,293 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 02:37:00,293 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 02:37:00,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,295 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,296 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 02:37:00,296 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 02:37:00,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,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 [2018-11-23 02:37:00,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,299 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,299 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,300 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,301 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,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 [2018-11-23 02:37:00,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,302 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,303 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,304 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,304 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,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 [2018-11-23 02:37:00,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,306 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,307 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,308 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,308 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,310 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,310 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 02:37:00,310 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 02:37:00,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,313 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,313 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:37:00,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:37:00,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:37:00,314 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,314 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 02:37:00,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:37:00,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:37:00,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:37:00,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:37:00,316 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:37:00,316 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:37:00,316 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 02:37:00,320 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-23 02:37:00,320 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 02:37:00,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:37:00,567 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 02:37:00,567 INFO L444 ModelExtractionUtils]: 40 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 02:37:00,568 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:37:00,569 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-23 02:37:00,569 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:37:00,569 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 + 1 f1 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_10 Supporting invariants [] [2018-11-23 02:37:00,741 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 02:37:00,746 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:37:00,747 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:37:00,747 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:37:00,747 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:37:00,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:00,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:00,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:00,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:37:00,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:00,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:00,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:37:00,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:00,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:00,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:00,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:37:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:00,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:00,946 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 02:37:00,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:01,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-11-23 02:37:01,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:01,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:01,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:01,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2018-11-23 02:37:01,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:01,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:01,090 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:01,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:01,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2018-11-23 02:37:01,519 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-11-23 02:37:01,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:01,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 162 [2018-11-23 02:37:02,988 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-11-23 02:37:02,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:02,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:02,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:02,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:02,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2018-11-23 02:37:02,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:03,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 118 [2018-11-23 02:37:03,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:03,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2018-11-23 02:37:03,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2018-11-23 02:37:03,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-11-23 02:37:03,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 02:37:03,370 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,378 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,387 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:03,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 96 [2018-11-23 02:37:03,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:03,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:03,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:03,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2018-11-23 02:37:03,462 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 67 [2018-11-23 02:37:03,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 02:37:03,483 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,489 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,498 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:03,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 152 [2018-11-23 02:37:05,846 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-11-23 02:37:05,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 114 [2018-11-23 02:37:05,850 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 127 [2018-11-23 02:37:06,183 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2018-11-23 02:37:06,187 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2018-11-23 02:37:06,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-11-23 02:37:06,477 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 83 [2018-11-23 02:37:06,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:06,500 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,508 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,517 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2018-11-23 02:37:06,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:37:06,687 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 02:37:06,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-23 02:37:06,705 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,710 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,717 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2018-11-23 02:37:06,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2018-11-23 02:37:06,728 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 75 [2018-11-23 02:37:06,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:06,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:06,751 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,758 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,766 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:06,834 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:06,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 02:37:06,862 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2018-11-23 02:37:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:06,908 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:37:06,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-23 02:37:07,009 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 72 states and 85 transitions. Complement of second has 12 states. [2018-11-23 02:37:07,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:37:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:37:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-23 02:37:07,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-23 02:37:07,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:37:07,010 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:37:07,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:07,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:07,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:07,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:37:07,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:07,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:07,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:37:07,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:37:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:07,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:07,150 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 02:37:07,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-11-23 02:37:07,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:07,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-11-23 02:37:07,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:07,250 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2018-11-23 02:37:07,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:07,290 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,297 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:07,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:07,314 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2018-11-23 02:37:07,635 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-11-23 02:37:07,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:07,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 162 [2018-11-23 02:37:08,887 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-11-23 02:37:08,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 118 [2018-11-23 02:37:08,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2018-11-23 02:37:09,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2018-11-23 02:37:09,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2018-11-23 02:37:09,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-11-23 02:37:09,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 02:37:09,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2018-11-23 02:37:09,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:09,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2018-11-23 02:37:09,369 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 67 [2018-11-23 02:37:09,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 02:37:09,394 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,400 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,407 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:09,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:09,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 152 [2018-11-23 02:37:11,119 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-11-23 02:37:11,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 127 [2018-11-23 02:37:11,126 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:11,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 117 [2018-11-23 02:37:11,130 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:11,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 114 [2018-11-23 02:37:11,410 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:11,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 131 [2018-11-23 02:37:11,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 178 [2018-11-23 02:37:11,721 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-11-23 02:37:11,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 114 [2018-11-23 02:37:11,856 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:11,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 77 [2018-11-23 02:37:11,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:11,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-23 02:37:11,959 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:11,969 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,051 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 92 treesize of output 103 [2018-11-23 02:37:12,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 87 [2018-11-23 02:37:12,054 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,068 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 114 [2018-11-23 02:37:12,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 125 [2018-11-23 02:37:12,081 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,097 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,175 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:37:12,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-11-23 02:37:12,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2018-11-23 02:37:12,419 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 75 [2018-11-23 02:37:12,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:12,443 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,450 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,458 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2018-11-23 02:37:12,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:37:12,466 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 02:37:12,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-23 02:37:12,484 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,489 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,496 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 110 [2018-11-23 02:37:12,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 128 [2018-11-23 02:37:12,606 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 99 [2018-11-23 02:37:12,680 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2018-11-23 02:37:12,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-11-23 02:37:12,752 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,766 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,818 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 85 treesize of output 86 [2018-11-23 02:37:12,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:12,822 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,832 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2018-11-23 02:37:12,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:12,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:12,867 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,878 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:12,897 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:12,932 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:12,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 02:37:12,959 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2018-11-23 02:37:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:13,006 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:37:13,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-23 02:37:13,110 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 70 states and 82 transitions. Complement of second has 12 states. [2018-11-23 02:37:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:37:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:37:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-23 02:37:13,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-23 02:37:13,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:37:13,111 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:37:13,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:13,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:13,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:13,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-23 02:37:13,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:13,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:13,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 02:37:13,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-23 02:37:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:13,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:13,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-11-23 02:37:13,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:13,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2018-11-23 02:37:13,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:13,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-11-23 02:37:13,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:37:13,393 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:13,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:13,421 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2018-11-23 02:37:13,717 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-11-23 02:37:13,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:13,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 162 [2018-11-23 02:37:15,088 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-11-23 02:37:15,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 139 [2018-11-23 02:37:15,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 118 [2018-11-23 02:37:15,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2018-11-23 02:37:15,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2018-11-23 02:37:15,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-11-23 02:37:15,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 02:37:15,490 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,498 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2018-11-23 02:37:15,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:15,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 120 [2018-11-23 02:37:15,570 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 67 [2018-11-23 02:37:15,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 02:37:15,593 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,600 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:15,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 273 treesize of output 152 [2018-11-23 02:37:17,895 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-11-23 02:37:17,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 114 [2018-11-23 02:37:17,899 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 127 [2018-11-23 02:37:18,261 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2018-11-23 02:37:18,265 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2018-11-23 02:37:18,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-23 02:37:18,604 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 02:37:18,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-23 02:37:18,626 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,631 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,639 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 96 [2018-11-23 02:37:18,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 114 [2018-11-23 02:37:18,651 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 75 [2018-11-23 02:37:18,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:18,673 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,681 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,689 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:18,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 131 [2018-11-23 02:37:18,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 178 [2018-11-23 02:37:18,853 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 3 xjuncts. [2018-11-23 02:37:18,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:18,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 114 [2018-11-23 02:37:18,984 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 77 [2018-11-23 02:37:19,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-23 02:37:19,084 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,094 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 93 [2018-11-23 02:37:19,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2018-11-23 02:37:19,182 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,194 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 114 [2018-11-23 02:37:19,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 125 [2018-11-23 02:37:19,206 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,222 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,297 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:37:19,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 110 [2018-11-23 02:37:19,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2018-11-23 02:37:19,408 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 124 [2018-11-23 02:37:19,484 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 112 [2018-11-23 02:37:19,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-11-23 02:37:19,560 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,574 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2018-11-23 02:37:19,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:19,628 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,639 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2018-11-23 02:37:19,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:37:19,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-11-23 02:37:19,689 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,698 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,713 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:37:19,741 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:37:19,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 02:37:19,770 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2018-11-23 02:37:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:19,819 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 02:37:19,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-23 02:37:19,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 91 states and 108 transitions. Complement of second has 11 states. [2018-11-23 02:37:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 02:37:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:37:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-11-23 02:37:19,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-23 02:37:19,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:37:19,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 23 letters. Loop has 5 letters. [2018-11-23 02:37:19,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:37:19,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 10 letters. [2018-11-23 02:37:19,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:37:19,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 108 transitions. [2018-11-23 02:37:19,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:37:19,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2018-11-23 02:37:19,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:37:19,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:37:19,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:37:19,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:37:19,926 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:37:19,926 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:37:19,926 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:37:19,926 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 02:37:19,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:37:19,927 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:37:19,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:37:19,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:37:19 BoogieIcfgContainer [2018-11-23 02:37:19,931 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:37:19,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:37:19,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:37:19,932 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:37:19,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:34:48" (3/4) ... [2018-11-23 02:37:19,934 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:37:19,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:37:19,935 INFO L168 Benchmark]: Toolchain (without parser) took 151694.27 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 956.4 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-23 02:37:19,935 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:37:19,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -194.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:19,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:19,935 INFO L168 Benchmark]: Boogie Preprocessor took 18.21 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:19,936 INFO L168 Benchmark]: RCFGBuilder took 209.80 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:19,936 INFO L168 Benchmark]: BuchiAutomizer took 151090.99 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-11-23 02:37:19,936 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 6.2 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:37:19,937 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -194.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.21 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 209.80 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 151090.99 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 2.92 ms. Allocated memory is still 6.2 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (5 trivial, 6 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 2 * unknown-#memory_int-unknown[y][y] + 1 else 2 * unknown-#memory_int-unknown[x][x]) and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 151.0s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 96.2s. Construction of modules took 1.4s. Büchi inclusion checks took 53.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 196 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 72 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/5 HoareTripleCheckerStatistics: 58 SDtfs, 222 SDslu, 61 SDs, 0 SdLazy, 1261 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital3231880 mio100 ax100 hnf99 lsp89 ukn5 mio100 lsp36 div100 bol102 ite100 ukn100 eq180 hnf89 smp94 dnf150 smp89 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 253ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...