./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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-635dfa2 [2018-12-09 10:16:12,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:16:12,325 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:16:12,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:16:12,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:16:12,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:16:12,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:16:12,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:16:12,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:16:12,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:16:12,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:16:12,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:16:12,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:16:12,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:16:12,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:16:12,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:16:12,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:16:12,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:16:12,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:16:12,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:16:12,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:16:12,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:16:12,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:16:12,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:16:12,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:16:12,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:16:12,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:16:12,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:16:12,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:16:12,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:16:12,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:16:12,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:16:12,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:16:12,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:16:12,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:16:12,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:16:12,347 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 10:16:12,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:16:12,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:16:12,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:16:12,356 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:16:12,356 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:16:12,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:16:12,357 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:16:12,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:16:12,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:16:12,358 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:16:12,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:16:12,358 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:16:12,358 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:16:12,358 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:16:12,359 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_4812ed76-1a9d-426f-9578-ac3ef00140df/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-12-09 10:16:12,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:16:12,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:16:12,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:16:12,384 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:16:12,385 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:16:12,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2018-12-09 10:16:12,422 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/data/401a4b7b5/1d60876e24e9472c97638ba6ab94c74d/FLAGe2d7ef6df [2018-12-09 10:16:12,806 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:16:12,806 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2018-12-09 10:16:12,812 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/data/401a4b7b5/1d60876e24e9472c97638ba6ab94c74d/FLAGe2d7ef6df [2018-12-09 10:16:12,820 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/bin-2019/uautomizer/data/401a4b7b5/1d60876e24e9472c97638ba6ab94c74d [2018-12-09 10:16:12,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:16:12,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:16:12,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:16:12,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:16:12,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:16:12,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:16:12" (1/1) ... [2018-12-09 10:16:12,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:12, skipping insertion in model container [2018-12-09 10:16:12,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:16:12" (1/1) ... [2018-12-09 10:16:12,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:16:12,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:16:13,004 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:16:13,010 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:16:13,069 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:16:13,092 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:16:13,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13 WrapperNode [2018-12-09 10:16:13,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:16:13,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:16:13,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:16:13,093 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:16:13,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:16:13,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:16:13,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:16:13,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:16:13,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... [2018-12-09 10:16:13,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:16:13,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:16:13,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:16:13,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:16:13,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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-12-09 10:16:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:16:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 10:16:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:16:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:16:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:16:13,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:16:13,300 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:16:13,300 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 10:16:13,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:13 BoogieIcfgContainer [2018-12-09 10:16:13,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:16:13,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:16:13,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:16:13,304 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:16:13,304 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:16:13,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:16:12" (1/3) ... [2018-12-09 10:16:13,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ed6d79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:16:13, skipping insertion in model container [2018-12-09 10:16:13,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:16:13,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:13" (2/3) ... [2018-12-09 10:16:13,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2ed6d79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:16:13, skipping insertion in model container [2018-12-09 10:16:13,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:16:13,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:13" (3/3) ... [2018-12-09 10:16:13,306 INFO L375 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca_true-termination.c.i [2018-12-09 10:16:13,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:16:13,340 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:16:13,340 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:16:13,340 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:16:13,340 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:16:13,340 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:16:13,340 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:16:13,341 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:16:13,341 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:16:13,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-09 10:16:13,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:16:13,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:13,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:13,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:16:13,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:13,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:16:13,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-09 10:16:13,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:16:13,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:13,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:13,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:16:13,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:13,372 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-12-09 10:16:13,372 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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 11#L556-1true [2018-12-09 10:16:13,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 10:16:13,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:13,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:13,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:13,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 1 times [2018-12-09 10:16:13,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:13,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:13,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:13,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849170, now seen corresponding path program 1 times [2018-12-09 10:16:13,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:13,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:13,739 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:16:13,914 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-12-09 10:16:13,968 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:13,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:13,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:13,969 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:13,969 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:13,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:13,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:13,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:13,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-09 10:16:13,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:13,970 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:13,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:13,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-12-09 10:16:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:13,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-12-09 10:16:13,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-12-09 10:16:13,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:13,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,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-12-09 10:16:14,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-12-09 10:16:14,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,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-12-09 10:16:14,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-12-09 10:16:14,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-12-09 10:16:14,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-12-09 10:16:14,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-12-09 10:16:14,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:14,574 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:14,577 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:14,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,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-12-09 10:16:14,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,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-12-09 10:16:14,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,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-12-09 10:16:14,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,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-12-09 10:16:14,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,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-12-09 10:16:14,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:16:14,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,624 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:16:14,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:14,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:14,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:14,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,678 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:14,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,679 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:14,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:14,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:14,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:14,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:14,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:14,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:14,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:14,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:14,693 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:14,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:16:14,698 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:16:14,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:14,700 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:16:14,701 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:14,701 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-12-09 10:16:14,752 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:14,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:14,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:14,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:14,869 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-12-09 10:16:14,872 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-12-09 10:16:14,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:14,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:14,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:14,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 10:16:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:14,910 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-12-09 10:16:14,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 6 states. [2018-12-09 10:16:15,036 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-12-09 10:16:15,037 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-12-09 10:16:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:16:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-12-09 10:16:15,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-09 10:16:15,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:15,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-09 10:16:15,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:15,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-09 10:16:15,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:15,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2018-12-09 10:16:15,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:16:15,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 29 transitions. [2018-12-09 10:16:15,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 10:16:15,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 10:16:15,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-12-09 10:16:15,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:15,046 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 10:16:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-12-09 10:16:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-09 10:16:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:16:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-12-09 10:16:15,062 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-12-09 10:16:15,062 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2018-12-09 10:16:15,062 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:16:15,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2018-12-09 10:16:15,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:16:15,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:15,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:15,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 10:16:15,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:15,063 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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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-12-09 10:16:15,064 INFO L796 eck$LassoCheckResult]: Loop: 233#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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-12-09 10:16:15,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-12-09 10:16:15,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:15,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:15,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:16:15,089 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:16:15,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:15,089 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 2 times [2018-12-09 10:16:15,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:15,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:15,288 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:16:15,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:16:15,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:16:15,338 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-09 10:16:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:15,346 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2018-12-09 10:16:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:16:15,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2018-12-09 10:16:15,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:16:15,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 22 transitions. [2018-12-09 10:16:15,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 10:16:15,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 10:16:15,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-12-09 10:16:15,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:15,348 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-09 10:16:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-12-09 10:16:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 10:16:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:16:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-09 10:16:15,349 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-09 10:16:15,349 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-09 10:16:15,349 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:16:15,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-12-09 10:16:15,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:16:15,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:15,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:15,350 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 10:16:15,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:15,350 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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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-12-09 10:16:15,350 INFO L796 eck$LassoCheckResult]: Loop: 275#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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-12-09 10:16:15,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-12-09 10:16:15,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:15,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:15,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 3 times [2018-12-09 10:16:15,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:15,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:15,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:15,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:15,373 INFO L82 PathProgramCache]: Analyzing trace with hash -304168138, now seen corresponding path program 1 times [2018-12-09 10:16:15,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:15,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:15,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:15,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:15,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:16:15,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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-12-09 10:16:15,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:15,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:15,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:15,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, 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-12-09 10:16:15,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:15,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:15,557 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-12-09 10:16:15,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,569 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-12-09 10:16:15,571 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-12-09 10:16:15,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,579 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-12-09 10:16:15,581 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-12-09 10:16:15,582 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,594 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-12-09 10:16:15,595 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-12-09 10:16:15,615 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-12-09 10:16:15,617 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-12-09 10:16:15,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-09 10:16:15,709 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-12-09 10:16:15,763 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-12-09 10:16:15,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:15,787 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-12-09 10:16:15,790 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-12-09 10:16:15,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,812 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-12-09 10:16:15,814 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-12-09 10:16:15,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,821 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,834 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-12-09 10:16:15,834 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:328, output treesize:46 [2018-12-09 10:16:15,920 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-12-09 10:16:15,923 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-12-09 10:16:15,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:15,933 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-12-09 10:16:15,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:15,939 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-12-09 10:16:15,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:15,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:15,952 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-12-09 10:16:15,952 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:20 [2018-12-09 10:16:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:15,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:16:15,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-12-09 10:16:16,139 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:16:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:16:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:16:16,181 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 14 states. [2018-12-09 10:16:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:16,566 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-12-09 10:16:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:16:16,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-12-09 10:16:16,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 10:16:16,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2018-12-09 10:16:16,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-09 10:16:16,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-09 10:16:16,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-12-09 10:16:16,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:16,570 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-12-09 10:16:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-12-09 10:16:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-09 10:16:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 10:16:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-12-09 10:16:16,573 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-09 10:16:16,573 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-09 10:16:16,573 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:16:16,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-12-09 10:16:16,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-09 10:16:16,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:16,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:16,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 10:16:16,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:16,575 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#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; 365#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 378#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; 384#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 382#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; 379#L554-2 [2018-12-09 10:16:16,576 INFO L796 eck$LassoCheckResult]: Loop: 379#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 368#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 385#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; 383#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 380#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~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; 379#L554-2 [2018-12-09 10:16:16,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 2 times [2018-12-09 10:16:16,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:16,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:16,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:16,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:16,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash 55629988, now seen corresponding path program 1 times [2018-12-09 10:16:16,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:16,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:16,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:16,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash -302321094, now seen corresponding path program 1 times [2018-12-09 10:16:16,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:16,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:16,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:16,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:16:16,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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-12-09 10:16:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:16,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:16,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:16,954 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-12-09 10:16:16,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:16,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:16,970 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-12-09 10:16:16,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:16,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:16,983 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-12-09 10:16:16,985 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-12-09 10:16:16,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:16,991 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-12-09 10:16:16,993 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-12-09 10:16:16,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:16,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:16,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,006 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-12-09 10:16:17,006 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-12-09 10:16:17,036 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-12-09 10:16:17,038 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-12-09 10:16:17,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-09 10:16:17,121 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-12-09 10:16:17,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-12-09 10:16:17,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:17,187 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-12-09 10:16:17,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, 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-12-09 10:16:17,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,204 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-12-09 10:16:17,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, 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-12-09 10:16:17,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,223 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-12-09 10:16:17,224 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:328, output treesize:46 [2018-12-09 10:16:17,311 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-12-09 10:16:17,313 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-12-09 10:16:17,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,320 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-12-09 10:16:17,320 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:17,325 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-12-09 10:16:17,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:17,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:17,334 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-12-09 10:16:17,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:14 [2018-12-09 10:16:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:17,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:16:17,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-12-09 10:16:17,546 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:16:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 10:16:17,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:16:17,606 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand 17 states. [2018-12-09 10:16:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:18,469 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-12-09 10:16:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:16:18,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2018-12-09 10:16:18,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-09 10:16:18,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2018-12-09 10:16:18,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 10:16:18,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 10:16:18,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2018-12-09 10:16:18,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:18,474 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-12-09 10:16:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2018-12-09 10:16:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-12-09 10:16:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 10:16:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-12-09 10:16:18,477 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-09 10:16:18,477 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-12-09 10:16:18,478 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:16:18,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-12-09 10:16:18,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 10:16:18,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:18,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:18,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 10:16:18,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:18,480 INFO L794 eck$LassoCheckResult]: Stem: 499#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#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; 498#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 511#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; 523#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 522#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; 513#L554-2 [2018-12-09 10:16:18,480 INFO L796 eck$LassoCheckResult]: Loop: 513#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 519#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 518#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; 517#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 512#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; 513#L554-2 [2018-12-09 10:16:18,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2018-12-09 10:16:18,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:18,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:18,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 1 times [2018-12-09 10:16:18,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:18,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:18,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:18,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash -304168136, now seen corresponding path program 1 times [2018-12-09 10:16:18,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:18,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:18,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:18,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:18,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:18,697 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-09 10:16:18,911 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2018-12-09 10:16:18,977 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:18,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:18,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:18,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:18,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:18,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:18,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:18,978 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:18,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-09 10:16:18,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:18,978 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,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-12-09 10:16:18,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,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-12-09 10:16:18,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-12-09 10:16:18,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-12-09 10:16:18,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:18,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,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-12-09 10:16:19,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:19,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:19,480 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:19,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:19,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:19,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,513 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:16:19,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,513 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:16:19,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:19,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:19,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,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-12-09 10:16:19,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:19,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-12-09 10:16:19,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:19,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:19,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:19,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:19,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:19,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:19,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:19,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:16:19,546 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:16:19,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:19,547 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:16:19,547 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:19,548 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-12-09 10:16:19,615 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:19,618 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:19,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:19,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:19,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:19,649 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-12-09 10:16:19,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:19,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:19,661 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-12-09 10:16:19,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:19,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:19,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:19,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:19,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:19,747 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-12-09 10:16:21,698 WARN L180 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-12-09 10:16:21,702 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-12-09 10:16:21,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:21,709 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-12-09 10:16:21,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,120 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-12-09 10:16:22,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:22,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 10:16:22,426 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,438 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-12-09 10:16:22,441 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-12-09 10:16:22,441 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,446 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,617 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-12-09 10:16:22,622 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-12-09 10:16:22,622 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,632 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-12-09 10:16:22,635 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-12-09 10:16:22,635 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,639 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,643 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,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, 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-12-09 10:16:22,667 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:16:22,669 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 75 treesize of output 100 [2018-12-09 10:16:22,669 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,725 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 66 treesize of output 72 [2018-12-09 10:16:22,726 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,771 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-12-09 10:16:22,771 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,813 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-12-09 10:16:22,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-09 10:16:22,816 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,821 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,858 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-12-09 10:16:22,861 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-12-09 10:16:22,861 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,870 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,901 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-12-09 10:16:22,904 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-12-09 10:16:22,904 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,910 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,926 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:22,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:22,958 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-12-09 10:16:22,958 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-12-09 10:16:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:23,029 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-12-09 10:16:23,029 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-09 10:16:23,095 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 43 states and 55 transitions. Complement of second has 10 states. [2018-12-09 10:16:23,095 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-12-09 10:16:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:16:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-09 10:16:23,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 5 letters. [2018-12-09 10:16:23,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:23,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-09 10:16:23,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:23,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 6 letters. Loop has 10 letters. [2018-12-09 10:16:23,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:23,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2018-12-09 10:16:23,096 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-09 10:16:23,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 50 transitions. [2018-12-09 10:16:23,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 10:16:23,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 10:16:23,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2018-12-09 10:16:23,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:23,097 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-09 10:16:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2018-12-09 10:16:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-09 10:16:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 10:16:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-12-09 10:16:23,099 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 49 transitions. [2018-12-09 10:16:23,099 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 49 transitions. [2018-12-09 10:16:23,099 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:16:23,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2018-12-09 10:16:23,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-09 10:16:23,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:23,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:23,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:23,100 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:23,100 INFO L794 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 733#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; 734#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 751#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; 756#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 753#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; 754#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 757#L556-1 [2018-12-09 10:16:23,100 INFO L796 eck$LassoCheckResult]: Loop: 757#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 758#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; 761#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 760#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; 759#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 757#L556-1 [2018-12-09 10:16:23,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 1 times [2018-12-09 10:16:23,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:23,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 4 times [2018-12-09 10:16:23,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:23,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:23,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:23,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:23,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:23,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:23,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940577, now seen corresponding path program 1 times [2018-12-09 10:16:23,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:23,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:23,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:23,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:23,296 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:16:23,809 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 113 [2018-12-09 10:16:23,967 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-09 10:16:23,970 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:23,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:23,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:23,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:23,971 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:23,971 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:23,971 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:23,971 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:23,971 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-09 10:16:23,971 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:23,971 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:23,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:23,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,165 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-12-09 10:16:24,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,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-12-09 10:16:24,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-12-09 10:16:24,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-12-09 10:16:24,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-12-09 10:16:24,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-12-09 10:16:24,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:24,482 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:24,482 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:24,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:24,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:24,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:24,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:24,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,485 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:16:24,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,485 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:16:24,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:24,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:24,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:24,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:24,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:24,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:24,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:24,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:24,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:24,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:24,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,502 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:24,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,503 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:24,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,506 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:24,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,506 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:24,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:24,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:24,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:24,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:24,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:24,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:24,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:24,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:24,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:24,531 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:16:24,531 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:16:24,531 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:24,532 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:16:24,532 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:24,532 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-12-09 10:16:24,584 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:24,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:24,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:24,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:24,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:24,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-12-09 10:16:24,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:24,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:24,628 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-12-09 10:16:24,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:24,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:24,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:24,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:24,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:24,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:24,697 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-12-09 10:16:24,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:24,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:24,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:24,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 10:16:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:24,723 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-12-09 10:16:24,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-12-09 10:16:24,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 49 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 76 states and 97 transitions. Complement of second has 12 states. [2018-12-09 10:16:24,799 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-12-09 10:16:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:16:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-09 10:16:24,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-09 10:16:24,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:24,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-09 10:16:24,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:24,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2018-12-09 10:16:24,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:24,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2018-12-09 10:16:24,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-09 10:16:24,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 95 transitions. [2018-12-09 10:16:24,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-09 10:16:24,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-12-09 10:16:24,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 95 transitions. [2018-12-09 10:16:24,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:24,802 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 95 transitions. [2018-12-09 10:16:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 95 transitions. [2018-12-09 10:16:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2018-12-09 10:16:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 10:16:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-12-09 10:16:24,804 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-12-09 10:16:24,804 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-12-09 10:16:24,804 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 10:16:24,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 87 transitions. [2018-12-09 10:16:24,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-12-09 10:16:24,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:24,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:24,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1] [2018-12-09 10:16:24,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:24,805 INFO L794 eck$LassoCheckResult]: Stem: 1022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1020#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; 1021#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1044#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; 1045#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 1039#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; 1040#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1056#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1050#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; 1042#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 1043#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; 1058#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1046#L556-1 [2018-12-09 10:16:24,805 INFO L796 eck$LassoCheckResult]: Loop: 1046#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1047#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; 1060#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 1059#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; 1057#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 1046#L556-1 [2018-12-09 10:16:24,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:24,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940579, now seen corresponding path program 2 times [2018-12-09 10:16:24,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:24,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:24,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:24,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:24,822 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 5 times [2018-12-09 10:16:24,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:24,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:24,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:24,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1666915826, now seen corresponding path program 2 times [2018-12-09 10:16:24,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:24,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:24,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:24,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:25,015 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-12-09 10:16:27,619 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 198 DAG size of output: 156 [2018-12-09 10:16:28,251 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-09 10:16:28,254 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:28,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:28,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:28,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:28,255 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:28,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:28,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:28,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:28,255 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-09 10:16:28,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:28,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:28,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,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-12-09 10:16:28,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,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-12-09 10:16:28,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,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-12-09 10:16:28,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-12-09 10:16:28,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:28,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:29,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:29,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:29,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:16:29,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,104 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:16:29,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:29,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:29,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:29,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,112 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:29,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,113 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:29,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:29,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,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-12-09 10:16:29,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,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-12-09 10:16:29,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,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-12-09 10:16:29,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,136 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:29,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,137 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:29,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:29,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-12-09 10:16:29,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:29,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:29,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:29,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:29,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:29,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:29,145 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:29,149 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:16:29,149 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:16:29,149 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:29,150 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:16:29,150 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:29,150 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-12-09 10:16:29,232 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:29,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:29,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:29,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:29,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,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, 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-12-09 10:16:29,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,286 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-12-09 10:16:29,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:29,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:29,351 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-12-09 10:16:29,352 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-12-09 10:16:29,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 10:16:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:29,379 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-12-09 10:16:29,379 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-09 10:16:29,462 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-12-09 10:16:29,463 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-12-09 10:16:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:16:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-09 10:16:29,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-09 10:16:29,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:29,463 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:16:29,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:29,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:29,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,495 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-12-09 10:16:29,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,508 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-12-09 10:16:29,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:29,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:29,575 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-12-09 10:16:29,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:16:29,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 10:16:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:29,604 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-12-09 10:16:29,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-09 10:16:29,675 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-12-09 10:16:29,676 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-12-09 10:16:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:16:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-12-09 10:16:29,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-09 10:16:29,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:29,676 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:16:29,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:29,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:29,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,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, 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-12-09 10:16:29,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:29,720 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-12-09 10:16:29,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:29,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:29,786 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-12-09 10:16:29,787 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-12-09 10:16:29,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:29,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 10:16:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:29,814 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-12-09 10:16:29,814 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 87 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-12-09 10:16:29,896 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-12-09 10:16:29,896 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-12-09 10:16:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:16:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-12-09 10:16:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-09 10:16:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 5 letters. [2018-12-09 10:16:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 12 letters. Loop has 10 letters. [2018-12-09 10:16:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:29,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2018-12-09 10:16:29,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-12-09 10:16:29,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 83 states and 105 transitions. [2018-12-09 10:16:29,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-09 10:16:29,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-12-09 10:16:29,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 105 transitions. [2018-12-09 10:16:29,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:29,900 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 105 transitions. [2018-12-09 10:16:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 105 transitions. [2018-12-09 10:16:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 38. [2018-12-09 10:16:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 10:16:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-12-09 10:16:29,903 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-12-09 10:16:29,903 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-12-09 10:16:29,903 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 10:16:29,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-12-09 10:16:29,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-12-09 10:16:29,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:29,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:29,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:16:29,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:29,904 INFO L794 eck$LassoCheckResult]: Stem: 1714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1712#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; 1713#L556-1 [2018-12-09 10:16:29,904 INFO L796 eck$LassoCheckResult]: Loop: 1713#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1724#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; 1741#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 1738#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; 1719#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1713#L556-1 [2018-12-09 10:16:29,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 10:16:29,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:29,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:29,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:29,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:29,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 1 times [2018-12-09 10:16:29,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:29,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:29,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:29,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:29,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:29,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849172, now seen corresponding path program 3 times [2018-12-09 10:16:29,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:29,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:29,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:29,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:29,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:30,095 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-12-09 10:16:30,245 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:30,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:30,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:30,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:30,245 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:30,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:30,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:30,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:30,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-09 10:16:30,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:30,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:30,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,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-12-09 10:16:30,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-12-09 10:16:30,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:30,661 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:30,662 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:30,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:30,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:30,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:30,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,697 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:30,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:30,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,700 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:30,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,701 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:30,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:30,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:30,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:30,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:30,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:30,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:30,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:30,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:30,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:30,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:30,732 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:30,736 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:16:30,736 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:16:30,737 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:30,737 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:16:30,737 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:30,737 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-12-09 10:16:30,808 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:30,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:30,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:30,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:30,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:30,884 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-12-09 10:16:30,886 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-12-09 10:16:30,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:30,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:30,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:30,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 10:16:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:30,914 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-12-09 10:16:30,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 10:16:30,988 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-12-09 10:16:30,989 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-12-09 10:16:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:16:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-09 10:16:30,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-09 10:16:30,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:30,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-09 10:16:30,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:30,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-09 10:16:30,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:30,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2018-12-09 10:16:30,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-12-09 10:16:30,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 52 states and 67 transitions. [2018-12-09 10:16:30,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 10:16:30,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 10:16:30,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2018-12-09 10:16:30,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:30,991 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2018-12-09 10:16:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2018-12-09 10:16:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2018-12-09 10:16:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 10:16:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2018-12-09 10:16:30,992 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-09 10:16:30,992 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2018-12-09 10:16:30,992 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 10:16:30,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2018-12-09 10:16:30,993 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-12-09 10:16:30,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:30,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:30,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:30,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:30,993 INFO L794 eck$LassoCheckResult]: Stem: 1961#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1959#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; 1960#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1982#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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 1984#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; 1978#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1963#L556-1 [2018-12-09 10:16:30,993 INFO L796 eck$LassoCheckResult]: Loop: 1963#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 1966#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; 1967#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 1970#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; 1962#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 1963#L556-1 [2018-12-09 10:16:30,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849234, now seen corresponding path program 2 times [2018-12-09 10:16:30,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:30,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:30,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:30,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:31,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 2 times [2018-12-09 10:16:31,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:31,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:31,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:31,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -782019355, now seen corresponding path program 1 times [2018-12-09 10:16:31,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:31,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:31,217 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-12-09 10:16:31,774 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2018-12-09 10:16:31,893 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-09 10:16:31,896 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:31,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:31,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:31,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:31,896 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:31,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:31,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:31,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:31,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration9_Lasso [2018-12-09 10:16:31,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:31,897 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:31,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-12-09 10:16:31,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:31,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:31,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:31,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-12-09 10:16:31,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:31,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:31,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:31,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-12-09 10:16:31,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:31,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-12-09 10:16:32,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-12-09 10:16:32,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:32,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-12-09 10:16:32,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:32,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-12-09 10:16:32,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-12-09 10:16:32,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-12-09 10:16:32,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-12-09 10:16:32,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:32,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-12-09 10:16:32,396 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:32,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:32,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,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-12-09 10:16:32,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,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-12-09 10:16:32,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,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-12-09 10:16:32,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,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-12-09 10:16:32,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,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-12-09 10:16:32,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:16:32,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:16:32,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:16:32,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,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-12-09 10:16:32,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,414 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:32,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,414 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:32,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,416 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:32,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,416 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:16:32,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,423 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:32,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:32,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:32,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:32,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:32,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:32,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:32,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:32,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:32,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:16:32,432 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:16:32,432 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:32,432 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:16:32,433 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:32,433 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-12-09 10:16:32,505 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:32,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:32,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:32,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:32,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:32,541 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-12-09 10:16:32,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:32,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:32,552 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-12-09 10:16:32,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:32,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:32,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-09 10:16:32,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:16:32,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-09 10:16:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:32,632 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-12-09 10:16:32,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-12-09 10:16:32,693 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-12-09 10:16:32,693 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-12-09 10:16:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:16:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-12-09 10:16:32,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-09 10:16:32,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:32,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 12 letters. Loop has 5 letters. [2018-12-09 10:16:32,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:32,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 7 letters. Loop has 10 letters. [2018-12-09 10:16:32,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:32,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 148 transitions. [2018-12-09 10:16:32,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-12-09 10:16:32,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 94 states and 119 transitions. [2018-12-09 10:16:32,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-09 10:16:32,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-12-09 10:16:32,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 119 transitions. [2018-12-09 10:16:32,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:32,696 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-12-09 10:16:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 119 transitions. [2018-12-09 10:16:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-12-09 10:16:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 10:16:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2018-12-09 10:16:32,698 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-12-09 10:16:32,698 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-12-09 10:16:32,698 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 10:16:32,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 94 transitions. [2018-12-09 10:16:32,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-12-09 10:16:32,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:32,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:32,698 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1] [2018-12-09 10:16:32,698 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:32,699 INFO L794 eck$LassoCheckResult]: Stem: 2296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2294#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; 2295#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2299#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; 2300#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2306#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; 2303#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2304#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2297#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; 2298#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2305#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; 2308#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2311#L556-1 [2018-12-09 10:16:32,699 INFO L796 eck$LassoCheckResult]: Loop: 2311#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2334#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; 2346#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2343#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; 2341#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2311#L556-1 [2018-12-09 10:16:32,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1737940641, now seen corresponding path program 2 times [2018-12-09 10:16:32,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:32,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:32,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:32,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:16:32,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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-12-09 10:16:32,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:16:32,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:16:32,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:16:32,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:32,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:32,954 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-12-09 10:16:32,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:32,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:32,965 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-12-09 10:16:32,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,977 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-12-09 10:16:32,979 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-12-09 10:16:32,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,985 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-12-09 10:16:32,986 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-12-09 10:16:32,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:32,996 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-12-09 10:16:32,996 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-12-09 10:16:33,027 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-12-09 10:16:33,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:16:33,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-09 10:16:33,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, 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-12-09 10:16:33,143 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-12-09 10:16:33,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:33,159 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-12-09 10:16:33,161 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-12-09 10:16:33,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,174 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-12-09 10:16:33,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-09 10:16:33,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,194 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-12-09 10:16:33,194 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:330, output treesize:46 [2018-12-09 10:16:33,294 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-12-09 10:16:33,296 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-12-09 10:16:33,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-09 10:16:33,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:33,310 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 18 treesize of output 14 [2018-12-09 10:16:33,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:33,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:16:33,319 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-12-09 10:16:33,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:14 [2018-12-09 10:16:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:16:33,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-12-09 10:16:33,352 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 10:16:33,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash 35409686, now seen corresponding path program 3 times [2018-12-09 10:16:33,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:33,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:33,523 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-12-09 10:16:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 10:16:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-09 10:16:33,574 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. cyclomatic complexity: 29 Second operand 18 states. [2018-12-09 10:16:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:34,039 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-12-09 10:16:34,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:16:34,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 125 transitions. [2018-12-09 10:16:34,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-12-09 10:16:34,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 100 states and 121 transitions. [2018-12-09 10:16:34,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-12-09 10:16:34,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-09 10:16:34,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 121 transitions. [2018-12-09 10:16:34,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:34,041 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 121 transitions. [2018-12-09 10:16:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 121 transitions. [2018-12-09 10:16:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-12-09 10:16:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 10:16:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2018-12-09 10:16:34,044 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2018-12-09 10:16:34,044 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2018-12-09 10:16:34,044 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 10:16:34,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 89 transitions. [2018-12-09 10:16:34,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-12-09 10:16:34,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:34,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:34,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:34,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1] [2018-12-09 10:16:34,046 INFO L794 eck$LassoCheckResult]: Stem: 2543#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2541#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; 2542#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2566#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; 2567#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2562#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; 2563#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2588#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2546#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; 2547#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2553#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; 2603#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 2556#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2557#L553-1 [2018-12-09 10:16:34,046 INFO L796 eck$LassoCheckResult]: Loop: 2557#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; 2608#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2609#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; 2548#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2549#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2546#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; 2547#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2553#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; 2603#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 2556#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2557#L553-1 [2018-12-09 10:16:34,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1527203716, now seen corresponding path program 1 times [2018-12-09 10:16:34,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:34,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:34,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash 480749795, now seen corresponding path program 1 times [2018-12-09 10:16:34,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:34,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:34,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 965322918, now seen corresponding path program 2 times [2018-12-09 10:16:34,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:34,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 10:16:34,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 10:16:34,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4812ed76-1a9d-426f-9578-ac3ef00140df/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-12-09 10:16:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 10:16:34,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 10:16:34,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 10:16:34,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:34,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:34,244 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-12-09 10:16:34,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:34,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:34,254 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-12-09 10:16:34,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-09 10:16:34,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-12-09 10:16:34,284 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-12-09 10:16:34,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-09 10:16:34,361 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-12-09 10:16:34,420 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-12-09 10:16:34,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:34,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:34,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:16:34,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,453 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-12-09 10:16:34,456 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-12-09 10:16:34,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:34,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:330, output treesize:46 [2018-12-09 10:16:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 10:16:34,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 10:16:34,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-12-09 10:16:35,372 WARN L180 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 125 [2018-12-09 10:16:35,576 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-09 10:16:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:16:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:16:35,576 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. cyclomatic complexity: 26 Second operand 14 states. [2018-12-09 10:16:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:35,946 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-12-09 10:16:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:16:35,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 101 transitions. [2018-12-09 10:16:35,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 10:16:35,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 77 states and 92 transitions. [2018-12-09 10:16:35,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-12-09 10:16:35,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-12-09 10:16:35,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 92 transitions. [2018-12-09 10:16:35,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:35,948 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-09 10:16:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 92 transitions. [2018-12-09 10:16:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2018-12-09 10:16:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 10:16:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-12-09 10:16:35,950 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-09 10:16:35,950 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-09 10:16:35,950 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 10:16:35,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2018-12-09 10:16:35,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 10:16:35,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:35,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:35,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:35,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1] [2018-12-09 10:16:35,951 INFO L794 eck$LassoCheckResult]: Stem: 2804#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2802#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; 2803#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; 2830#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2828#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; 2829#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2834#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2816#L553-1 [2018-12-09 10:16:35,951 INFO L796 eck$LassoCheckResult]: Loop: 2816#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2857#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2852#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; 2853#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 2856#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2855#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; 2854#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 2818#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; 2819#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 2810#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 2816#L553-1 [2018-12-09 10:16:35,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash 177751413, now seen corresponding path program 3 times [2018-12-09 10:16:35,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:35,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:35,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1294255583, now seen corresponding path program 1 times [2018-12-09 10:16:35,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:35,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:35,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2067938965, now seen corresponding path program 3 times [2018-12-09 10:16:35,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:35,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:35,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:36,951 WARN L180 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 132 [2018-12-09 10:16:37,902 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2018-12-09 10:16:38,493 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 125 [2018-12-09 10:16:39,887 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 103 DAG size of output: 103 [2018-12-09 10:16:39,890 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:39,890 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:39,890 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:39,890 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:39,890 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:39,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:39,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:39,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:39,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration12_Lasso [2018-12-09 10:16:39,891 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:39,891 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:39,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:39,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-12-09 10:16:40,289 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2018-12-09 10:16:40,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-09 10:16:40,562 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2018-12-09 10:16:40,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,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-12-09 10:16:40,971 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:16:40,971 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:16:40,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:40,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:40,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:40,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:40,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:40,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:40,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:40,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:40,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:40,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:40,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:16:40,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:16:40,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:40,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:16:40,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:16:40,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:16:40,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:16:40,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:16:40,975 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:16:40,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:16:40,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:16:40,977 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-09 10:16:40,978 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 10:16:41,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:16:41,049 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 10:16:41,050 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 10:16:41,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:16:41,051 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-09 10:16:41,051 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:16:41,051 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-12-09 10:16:41,160 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:16:41,163 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:16:41,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:41,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:41,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:41,202 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-12-09 10:16:41,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:41,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:41,212 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-12-09 10:16:41,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:41,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:41,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:41,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:41,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:41,240 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-12-09 10:16:41,241 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-12-09 10:16:41,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:41,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:41,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:41,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 10:16:41,313 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-12-09 10:16:42,877 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2018-12-09 10:16:42,880 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-12-09 10:16:42,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,198 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-12-09 10:16:43,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,203 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-12-09 10:16:43,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,516 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-12-09 10:16:43,518 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-12-09 10:16:43,518 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,533 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-12-09 10:16:43,535 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-12-09 10:16:43,536 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,540 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,544 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,725 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-12-09 10:16:43,728 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-12-09 10:16:43,728 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,779 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-12-09 10:16:43,780 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,820 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-12-09 10:16:43,822 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-12-09 10:16:43,822 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,827 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2018-12-09 10:16:43,865 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-12-09 10:16:43,866 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,872 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,897 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:43,904 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-12-09 10:16:43,906 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-12-09 10:16:43,907 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,917 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-12-09 10:16:43,919 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-12-09 10:16:43,920 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,923 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,928 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:43,972 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2018-12-09 10:16:44,028 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-12-09 10:16:44,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:16:44,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:44,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:44,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:44,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2018-12-09 10:16:44,121 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-12-09 10:16:45,840 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2018-12-09 10:16:45,844 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-12-09 10:16:45,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,136 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-12-09 10:16:46,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,139 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-12-09 10:16:46,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,333 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-12-09 10:16:46,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,338 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-12-09 10:16:46,338 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,352 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-12-09 10:16:46,354 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-12-09 10:16:46,354 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,359 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:46,374 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-12-09 10:16:46,374 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,389 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-12-09 10:16:46,392 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-12-09 10:16:46,393 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,398 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,404 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:46,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2018-12-09 10:16:46,499 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,575 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-12-09 10:16:46,576 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-12-09 10:16:46,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,700 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-12-09 10:16:46,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,703 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-12-09 10:16:46,704 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,714 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,721 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-12-09 10:16:46,724 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-12-09 10:16:46,724 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,735 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,786 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-12-09 10:16:46,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,789 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-12-09 10:16:46,789 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,796 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,841 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 10:16:46,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 88 [2018-12-09 10:16:46,904 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-12-09 10:16:46,904 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:46,950 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-12-09 10:16:46,950 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:46,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:46,996 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-12-09 10:16:46,997 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,004 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,037 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-12-09 10:16:47,039 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-12-09 10:16:47,039 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,047 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,073 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:47,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:47,100 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-12-09 10:16:47,100 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2018-12-09 10:16:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:47,119 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-12-09 10:16:47,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-12-09 10:16:47,217 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-12-09 10:16:47,217 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-12-09 10:16:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 10:16:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2018-12-09 10:16:47,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-09 10:16:47,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:47,218 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:16:47,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:47,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:47,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:47,248 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-12-09 10:16:47,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:47,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:47,261 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-12-09 10:16:47,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:47,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:47,290 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-12-09 10:16:47,291 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-12-09 10:16:47,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:47,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 10:16:47,369 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-12-09 10:16:48,830 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2018-12-09 10:16:48,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2018-12-09 10:16:48,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:48,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2018-12-09 10:16:48,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-09 10:16:49,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,459 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-12-09 10:16:49,463 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-12-09 10:16:49,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,475 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-12-09 10:16:49,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, 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-12-09 10:16:49,477 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,492 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-12-09 10:16:49,494 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-12-09 10:16:49,495 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,508 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-12-09 10:16:49,510 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-12-09 10:16:49,510 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,513 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,518 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,605 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-12-09 10:16:49,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:16:49,608 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,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, 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-12-09 10:16:49,623 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-12-09 10:16:49,623 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,628 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,632 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,654 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2018-12-09 10:16:49,709 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-12-09 10:16:49,711 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-12-09 10:16:49,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:49,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2018-12-09 10:16:49,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:51,056 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2018-12-09 10:16:51,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:16:51,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,253 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-12-09 10:16:51,253 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,259 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-12-09 10:16:51,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,443 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-12-09 10:16:51,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:16:51,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:51,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-12-09 10:16:51,463 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,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 97 treesize of output 92 [2018-12-09 10:16:51,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2018-12-09 10:16:51,603 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,678 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 75 treesize of output 130 [2018-12-09 10:16:51,678 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-12-09 10:16:51,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,759 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 67 treesize of output 88 [2018-12-09 10:16:51,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,761 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 71 [2018-12-09 10:16:51,762 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,772 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,779 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 83 treesize of output 76 [2018-12-09 10:16:51,781 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 64 treesize of output 88 [2018-12-09 10:16:51,781 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,791 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,844 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-12-09 10:16:51,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:51,846 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-12-09 10:16:51,846 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,854 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:51,906 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 10:16:51,990 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-12-09 10:16:51,993 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-12-09 10:16:51,993 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:52,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:52,054 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-12-09 10:16:52,055 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,100 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-12-09 10:16:52,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 55 treesize of output 70 [2018-12-09 10:16:52,102 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,111 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,154 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-12-09 10:16:52,157 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-12-09 10:16:52,157 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,166 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,194 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-12-09 10:16:52,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-12-09 10:16:52,196 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,203 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,215 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:52,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:52,221 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-12-09 10:16:52,223 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-12-09 10:16:52,223 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,238 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-12-09 10:16:52,240 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-12-09 10:16:52,240 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,245 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,250 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:52,275 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-12-09 10:16:52,275 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2018-12-09 10:16:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:52,296 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-12-09 10:16:52,296 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-12-09 10:16:52,432 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-12-09 10:16:52,432 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-12-09 10:16:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 10:16:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-12-09 10:16:52,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 18 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-09 10:16:52,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:52,433 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:16:52,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:52,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:52,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:52,464 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-12-09 10:16:52,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:52,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:52,479 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-12-09 10:16:52,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:16:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:52,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:16:52,506 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-12-09 10:16:52,508 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-12-09 10:16:52,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:52,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-09 10:16:52,591 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-12-09 10:16:54,032 WARN L180 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2018-12-09 10:16:54,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2018-12-09 10:16:54,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:54,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2018-12-09 10:16:54,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:54,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-09 10:16:54,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:54,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:54,966 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-12-09 10:16:54,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:54,979 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-12-09 10:16:54,982 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-12-09 10:16:54,983 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:54,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:54,993 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,217 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-12-09 10:16:55,220 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-12-09 10:16:55,220 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,274 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-12-09 10:16:55,274 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-12-09 10:16:55,322 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-12-09 10:16:55,322 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,330 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,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, 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-12-09 10:16:55,371 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-12-09 10:16:55,371 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,379 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,412 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-12-09 10:16:55,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-09 10:16:55,415 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,424 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:55,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:55,449 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-12-09 10:16:55,449 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,459 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-12-09 10:16:55,461 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-12-09 10:16:55,462 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,466 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,470 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,503 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 1 variables, input treesize:320, output treesize:36 [2018-12-09 10:16:55,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, 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-12-09 10:16:55,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2018-12-09 10:16:55,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:55,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:36 [2018-12-09 10:16:55,648 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-12-09 10:16:57,626 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 165 DAG size of output: 102 [2018-12-09 10:16:57,629 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-12-09 10:16:57,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:57,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:57,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2018-12-09 10:16:57,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:57,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:57,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, 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-12-09 10:16:57,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,036 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-12-09 10:16:58,039 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-12-09 10:16:58,039 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,053 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-12-09 10:16:58,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 40 treesize of output 35 [2018-12-09 10:16:58,055 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,061 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,065 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:58,168 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-12-09 10:16:58,170 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-12-09 10:16:58,171 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,183 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-12-09 10:16:58,185 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-12-09 10:16:58,185 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,189 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,194 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:16:58,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:58,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:16:58,216 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-12-09 10:16:58,216 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,263 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-12-09 10:16:58,263 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,304 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-12-09 10:16:58,307 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-12-09 10:16:58,307 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,313 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,349 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-12-09 10:16:58,351 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-12-09 10:16:58,352 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,358 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,386 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:16:58,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:16:58,420 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-12-09 10:16:58,420 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 3 variables, input treesize:329, output treesize:43 [2018-12-09 10:16:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:58,437 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-12-09 10:16:58,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-12-09 10:16:58,530 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-12-09 10:16:58,531 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-12-09 10:16:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 10:16:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-12-09 10:16:58,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 10 letters. [2018-12-09 10:16:58,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 18 letters. Loop has 10 letters. [2018-12-09 10:16:58,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:58,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 20 letters. [2018-12-09 10:16:58,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:16:58,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 180 transitions. [2018-12-09 10:16:58,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:16:58,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 100 states and 124 transitions. [2018-12-09 10:16:58,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 10:16:58,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 10:16:58,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 124 transitions. [2018-12-09 10:16:58,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:16:58,535 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2018-12-09 10:16:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 124 transitions. [2018-12-09 10:16:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 64. [2018-12-09 10:16:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 10:16:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-12-09 10:16:58,537 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-12-09 10:16:58,537 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-12-09 10:16:58,537 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 10:16:58,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2018-12-09 10:16:58,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:16:58,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:16:58,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:16:58,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 10:16:58,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:16:58,538 INFO L794 eck$LassoCheckResult]: Stem: 3685#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3683#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; 3684#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3713#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; 3711#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 3709#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; 3708#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 3696#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3697#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; 3718#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 3717#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; 3700#L554-2 [2018-12-09 10:16:58,538 INFO L796 eck$LassoCheckResult]: Loop: 3700#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 3702#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 3719#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; 3693#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 3694#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; 3700#L554-2 [2018-12-09 10:16:58,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash -302321096, now seen corresponding path program 3 times [2018-12-09 10:16:58,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:58,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:58,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 2 times [2018-12-09 10:16:58,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:58,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash 337347019, now seen corresponding path program 4 times [2018-12-09 10:16:58,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:16:58,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:16:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:16:58,763 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-09 10:16:59,762 WARN L180 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 142 [2018-12-09 10:16:59,936 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-12-09 10:16:59,939 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:16:59,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:16:59,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:16:59,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:16:59,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:16:59,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:16:59,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:16:59,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:16:59,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration13_Lasso [2018-12-09 10:16:59,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:16:59,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:16:59,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-12-09 10:16:59,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-12-09 10:17:00,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:00,461 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:17:00,461 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:17:00,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:00,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:17:00,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:00,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:17:00,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:17:00,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:00,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-12-09 10:17:00,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:00,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:00,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:00,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:00,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:00,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,464 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:17:00,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,464 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:17:00,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:00,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:00,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:00,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,466 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:17:00,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:17:00,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:00,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:00,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:00,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,467 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:17:00,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,468 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:17:00,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:00,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:00,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-12-09 10:17:00,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:00,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:00,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:00,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:00,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:00,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:00,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:00,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:00,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:00,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:00,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:00,481 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:17:00,484 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 10:17:00,484 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 10:17:00,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:17:00,484 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:17:00,484 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:17:00,485 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-12-09 10:17:00,548 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:17:00,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:17:00,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:00,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:00,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:00,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, 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-12-09 10:17:00,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:00,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:00,596 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-12-09 10:17:00,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:00,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:00,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:00,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:17:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:00,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:00,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:17:02,395 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-12-09 10:17:02,398 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-12-09 10:17:02,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:02,731 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-12-09 10:17:02,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:02,736 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-12-09 10:17:02,737 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:17:03,041 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-12-09 10:17:03,049 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-12-09 10:17:03,049 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,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 53 treesize of output 49 [2018-12-09 10:17:03,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:17:03,139 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-12-09 10:17:03,139 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,147 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,182 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-12-09 10:17:03,184 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-12-09 10:17:03,184 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,191 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,211 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-12-09 10:17:03,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 33 treesize of output 28 [2018-12-09 10:17:03,214 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,219 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:17:03,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:17:03,240 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-12-09 10:17:03,240 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,250 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-12-09 10:17:03,252 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-12-09 10:17:03,253 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,256 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,260 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,268 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-12-09 10:17:03,286 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-12-09 10:17:03,287 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 10:17:03,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 63 treesize of output 66 [2018-12-09 10:17:03,317 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-12-09 10:17:03,317 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,324 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:17:03,333 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-12-09 10:17:03,334 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,341 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,347 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-12-09 10:17:03,350 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-12-09 10:17:03,350 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,358 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,379 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 10:17:03,458 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-12-09 10:17:03,459 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-12-09 10:17:03,459 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,473 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-12-09 10:17:03,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, 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-12-09 10:17:03,476 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,482 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,485 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:03,507 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-12-09 10:17:03,507 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-12-09 10:17:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:03,572 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-12-09 10:17:03,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26 Second operand 6 states. [2018-12-09 10:17:03,640 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-12-09 10:17:03,640 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-12-09 10:17:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:17:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-09 10:17:03,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 5 letters. [2018-12-09 10:17:03,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:03,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-09 10:17:03,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:03,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 11 letters. Loop has 10 letters. [2018-12-09 10:17:03,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:03,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-12-09 10:17:03,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:17:03,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 98 transitions. [2018-12-09 10:17:03,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 10:17:03,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 10:17:03,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 98 transitions. [2018-12-09 10:17:03,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:17:03,642 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 98 transitions. [2018-12-09 10:17:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 98 transitions. [2018-12-09 10:17:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-12-09 10:17:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 10:17:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2018-12-09 10:17:03,644 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2018-12-09 10:17:03,644 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2018-12-09 10:17:03,644 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 10:17:03,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2018-12-09 10:17:03,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:17:03,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:17:03,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:17:03,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-12-09 10:17:03,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:17:03,645 INFO L794 eck$LassoCheckResult]: Stem: 4029#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4027#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; 4028#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4034#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; 4035#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4087#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; 4086#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 4079#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~short9;havoc main_#t~mem7;havoc main_#t~mem8;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~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; 4078#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4077#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4060#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; 4065#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4051#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; 4047#L554-2 [2018-12-09 10:17:03,646 INFO L796 eck$LassoCheckResult]: Loop: 4047#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 4048#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4066#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; 4038#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4039#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; 4047#L554-2 [2018-12-09 10:17:03,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 88414793, now seen corresponding path program 5 times [2018-12-09 10:17:03,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:17:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:17:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:17:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 3 times [2018-12-09 10:17:03,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:17:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:17:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:17:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:03,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1508686938, now seen corresponding path program 6 times [2018-12-09 10:17:03,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:17:03,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:17:03,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:17:03,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,859 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-12-09 10:17:07,865 WARN L180 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 232 DAG size of output: 179 [2018-12-09 10:17:08,458 WARN L180 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-09 10:17:08,461 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:17:08,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:17:08,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:17:08,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:17:08,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:17:08,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:17:08,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:17:08,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:17:08,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration14_Lasso [2018-12-09 10:17:08,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:17:08,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:17:08,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,569 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-12-09 10:17:09,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:09,906 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:17:09,906 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:17:09,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:09,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:09,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:09,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:09,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:09,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:09,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:09,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:09,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:09,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:09,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:09,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:09,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:09,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:09,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:09,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:09,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:09,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:09,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:09,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:09,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:09,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:09,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:09,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:09,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:09,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:09,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:09,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:09,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:09,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:09,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:09,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:17:09,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:17:09,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:17:09,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:17:09,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:17:09,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:17:09,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:17:09,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:17:09,937 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:17:09,941 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-09 10:17:09,941 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 10:17:09,942 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:17:09,942 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 10:17:09,942 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:17:09,942 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-12-09 10:17:10,017 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:17:10,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:17:10,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:10,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:10,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:10,053 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-12-09 10:17:10,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:10,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:10,065 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-12-09 10:17:10,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:10,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:10,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:10,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:17:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:10,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:10,145 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-12-09 10:17:11,685 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-12-09 10:17:11,689 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-12-09 10:17:11,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:11,991 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-12-09 10:17:11,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:11,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, 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-12-09 10:17:11,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:17:12,236 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-12-09 10:17:12,237 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-12-09 10:17:12,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:17:12,252 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-12-09 10:17:12,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,261 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,430 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-12-09 10:17:12,434 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-12-09 10:17:12,434 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,444 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-12-09 10:17:12,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-09 10:17:12,446 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,450 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,454 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,473 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-12-09 10:17:12,478 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 64 treesize of output 57 [2018-12-09 10:17:12,478 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,529 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 65 treesize of output 67 [2018-12-09 10:17:12,529 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,568 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-12-09 10:17:12,570 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-12-09 10:17:12,570 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,576 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,610 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-12-09 10:17:12,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 10:17:12,613 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,620 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,648 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-12-09 10:17:12,650 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-12-09 10:17:12,651 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,657 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,671 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:17:12,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,702 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-12-09 10:17:12,702 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-12-09 10:17:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:12,769 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-12-09 10:17:12,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2018-12-09 10:17:12,833 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-12-09 10:17:12,833 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-12-09 10:17:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:17:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-09 10:17:12,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-09 10:17:12,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:12,834 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:17:12,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:12,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:12,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:12,865 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-12-09 10:17:12,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:12,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:12,878 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-12-09 10:17:12,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:12,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:17:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:12,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:12,958 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-12-09 10:17:14,311 WARN L180 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-12-09 10:17:14,314 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-12-09 10:17:14,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:14,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12-09 10:17:14,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:17:14,707 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-12-09 10:17:14,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,017 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-12-09 10:17:15,025 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-12-09 10:17:15,025 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12-09 10:17:15,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,114 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-12-09 10:17:15,116 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-12-09 10:17:15,116 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,121 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,157 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-12-09 10:17:15,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 10:17:15,160 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,167 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,198 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-12-09 10:17:15,201 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-12-09 10:17:15,201 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,207 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:17:15,229 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-12-09 10:17:15,248 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-12-09 10:17:15,249 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 10:17:15,279 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-12-09 10:17:15,282 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-12-09 10:17:15,282 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,290 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,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-12-09 10:17:15,300 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-12-09 10:17:15,300 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,308 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,313 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-12-09 10:17:15,317 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-12-09 10:17:15,317 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,326 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,346 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 10:17:15,354 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-12-09 10:17:15,357 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-12-09 10:17:15,357 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,367 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-12-09 10:17:15,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:17:15,370 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,373 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,378 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,521 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-12-09 10:17:15,522 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-12-09 10:17:15,523 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,535 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-12-09 10:17:15,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:17:15,538 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,543 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,546 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:17:15,570 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-12-09 10:17:15,570 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-12-09 10:17:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:15,636 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-12-09 10:17:15,636 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2018-12-09 10:17:15,718 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-12-09 10:17:15,718 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-12-09 10:17:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:17:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-09 10:17:15,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-09 10:17:15,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:15,719 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:17:15,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:15,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:15,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:15,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, 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-12-09 10:17:15,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:15,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:17:15,762 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-12-09 10:17:15,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:15,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:17:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:15,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:17:15,840 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-12-09 10:17:17,272 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 155 DAG size of output: 101 [2018-12-09 10:17:17,276 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-12-09 10:17:17,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 10:17:17,283 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-12-09 10:17:17,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,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, 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-12-09 10:17:17,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,780 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-12-09 10:17:17,783 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-12-09 10:17:17,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,794 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-12-09 10:17:17,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-12-09 10:17:17,797 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,801 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,806 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,812 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-12-09 10:17:17,815 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-12-09 10:17:17,815 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,825 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-12-09 10:17:17,828 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-12-09 10:17:17,828 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,836 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,921 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-12-09 10:17:17,941 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-12-09 10:17:17,942 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 10:17:17,975 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-12-09 10:17:17,978 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-12-09 10:17:17,979 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,990 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:17,997 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-12-09 10:17:18,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:17:18,000 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,008 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,015 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-12-09 10:17:18,018 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-12-09 10:17:18,018 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,026 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,050 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-09 10:17:18,103 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-12-09 10:17:18,105 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-12-09 10:17:18,105 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,121 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-12-09 10:17:18,123 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-12-09 10:17:18,124 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,130 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,134 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:17:18,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:17:18,160 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-12-09 10:17:18,160 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 2 variables, input treesize:309, output treesize:36 [2018-12-09 10:17:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:18,225 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-12-09 10:17:18,225 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 81 transitions. cyclomatic complexity: 25 Second operand 6 states. [2018-12-09 10:17:18,283 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-12-09 10:17:18,284 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-12-09 10:17:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 10:17:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-12-09 10:17:18,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 5 letters. [2018-12-09 10:17:18,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:18,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 21 letters. Loop has 5 letters. [2018-12-09 10:17:18,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:18,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 16 letters. Loop has 10 letters. [2018-12-09 10:17:18,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:17:18,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2018-12-09 10:17:18,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:17:18,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 50 states and 62 transitions. [2018-12-09 10:17:18,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 10:17:18,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 10:17:18,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2018-12-09 10:17:18,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:17:18,285 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-12-09 10:17:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2018-12-09 10:17:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-12-09 10:17:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 10:17:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-12-09 10:17:18,286 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-12-09 10:17:18,286 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-12-09 10:17:18,286 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 10:17:18,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2018-12-09 10:17:18,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 10:17:18,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:17:18,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:17:18,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 1, 1, 1, 1] [2018-12-09 10:17:18,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 10:17:18,287 INFO L794 eck$LassoCheckResult]: Stem: 4701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4699#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; 4700#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4720#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; 4719#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4717#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; 4718#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4713#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4714#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; 4736#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4735#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~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem19;havoc main_#t~mem18; 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; 4733#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; 4732#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4730#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; 4727#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4722#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4721#L553-1 [2018-12-09 10:17:18,287 INFO L796 eck$LassoCheckResult]: Loop: 4721#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; 4710#L553-3 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8;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); 4711#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; 4706#L554-2 assume !(0 != main_#t~nondet14);havoc main_#t~nondet14;call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem20;havoc main_#t~mem21;call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem22;call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem24;havoc main_#t~mem23; 4707#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 4721#L553-1 [2018-12-09 10:17:18,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2067938965, now seen corresponding path program 7 times [2018-12-09 10:17:18,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:17:18,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:17:18,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:18,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:17:18,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:18,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 38421686, now seen corresponding path program 4 times [2018-12-09 10:17:18,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:17:18,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:17:18,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:18,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:18,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:18,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 155976354, now seen corresponding path program 8 times [2018-12-09 10:17:18,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:17:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:17:18,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:18,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:17:18,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:18,587 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-12-09 10:17:18,918 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2018-12-09 10:17:31,104 WARN L180 SmtUtils]: Spent 12.18 s on a formula simplification. DAG size of input: 268 DAG size of output: 218 [2018-12-09 10:17:53,686 WARN L180 SmtUtils]: Spent 22.57 s on a formula simplification. DAG size of input: 157 DAG size of output: 157 [2018-12-09 10:17:53,690 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:17:53,690 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:17:53,690 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:17:53,690 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:17:53,691 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:17:53,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:17:53,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:17:53,691 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:17:53,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration15_Lasso [2018-12-09 10:17:53,691 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:17:53,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:17:53,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-12-09 10:17:53,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-12-09 10:17:53,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-12-09 10:17:53,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:53,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:17:53,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-12-09 10:17:53,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-12-09 10:17:53,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-12-09 10:17:53,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-12-09 10:17:53,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-12-09 10:18:27,991 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-09 10:18:28,198 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-09 10:18:28,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:18:28,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:18:28,672 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:18:28,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,685 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,686 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:18:28,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,689 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:18:28,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,691 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,691 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:18:28,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,693 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-09 10:18:28,694 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 10:18:28,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,748 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,748 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 10:18:28,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,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-12-09 10:18:28,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:18:28,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:18:28,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:18:28,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:18:28,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,771 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-09 10:18:28,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-12-09 10:18:28,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,772 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-09 10:18:28,772 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-09 10:18:28,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,774 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,774 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,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-12-09 10:18:28,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,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-12-09 10:18:28,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,776 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,776 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,778 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-09 10:18:28,778 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-09 10:18:28,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,779 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,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-12-09 10:18:28,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,780 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,780 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,782 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,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-12-09 10:18:28,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:18:28,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:18:28,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,783 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-09 10:18:28,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:18:28,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,784 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,784 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 10:18:28,784 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-09 10:18:28,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,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-12-09 10:18:28,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,787 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:18:28,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,787 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-09 10:18:28,787 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-09 10:18:28,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:18:28,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 10:18:28,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:18:28,790 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 10:18:28,790 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:18:28,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-09 10:18:28,792 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-09 10:18:28,793 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-09 10:18:28,948 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:18:29,014 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 10:18:29,014 INFO L444 ModelExtractionUtils]: 19 out of 49 variables were initially zero. Simplification set additionally 26 variables to zero. [2018-12-09 10:18:29,014 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:18:29,015 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-12-09 10:18:29,015 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:18:29,016 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-12-09 10:18:29,171 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 10:18:29,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:18:29,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:18:29,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:18:29,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 10:18:29,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:29,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:29,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:29,239 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-12-09 10:18:29,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:29,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:29,253 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-12-09 10:18:29,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:18:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:29,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:29,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-12-09 10:18:29,392 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-12-09 10:18:29,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,473 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-12-09 10:18:29,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 10:18:29,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:29,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:29,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2018-12-09 10:18:29,829 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-12-09 10:18:29,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:18:32,577 WARN L180 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-12-09 10:18:32,581 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-12-09 10:18:32,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:32,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:32,985 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-12-09 10:18:32,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:32,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:32,991 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-12-09 10:18:32,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2018-12-09 10:18:33,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12-09 10:18:33,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,333 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-12-09 10:18:33,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-12-09 10:18:33,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,342 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,355 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-12-09 10:18:33,357 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-12-09 10:18:33,357 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,370 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-12-09 10:18:33,372 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-12-09 10:18:33,372 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,377 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,383 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,522 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-12-09 10:18:33,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:18:33,525 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,594 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-12-09 10:18:33,594 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 86 [2018-12-09 10:18:33,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,667 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-12-09 10:18:33,668 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,679 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,731 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-12-09 10:18:33,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,734 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-12-09 10:18:33,734 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,744 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,756 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:33,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:33,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:33,887 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-12-09 10:18:34,913 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-12-09 10:18:34,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:34,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:34,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:34,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:34,919 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-12-09 10:18:34,919 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,088 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-12-09 10:18:35,088 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 96 [2018-12-09 10:18:35,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,294 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-12-09 10:18:35,294 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,312 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-12-09 10:18:35,315 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-12-09 10:18:35,315 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,321 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,328 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 128 [2018-12-09 10:18:35,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,440 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:18:35,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,448 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 192 [2018-12-09 10:18:35,448 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2018-12-09 10:18:35,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 37 treesize of output 32 [2018-12-09 10:18:35,483 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,496 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,506 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 114 [2018-12-09 10:18:35,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 105 [2018-12-09 10:18:35,580 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 130 [2018-12-09 10:18:35,654 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2018-12-09 10:18:35,725 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-12-09 10:18:35,726 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,734 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:35,787 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 101 treesize of output 104 [2018-12-09 10:18:35,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:18:35,791 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,804 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2018-12-09 10:18:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-12-09 10:18:35,850 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,858 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,871 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,888 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:35,914 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-12-09 10:18:35,914 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2018-12-09 10:18:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:35,963 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-12-09 10:18:35,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-12-09 10:18:36,097 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-12-09 10:18:36,097 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-12-09 10:18:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:18:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-09 10:18:36,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 18 letters. Loop has 5 letters. [2018-12-09 10:18:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:18:36,098 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:18:36,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:36,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:36,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:36,138 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-12-09 10:18:36,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:36,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:36,147 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-12-09 10:18:36,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:18:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:36,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:36,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2018-12-09 10:18:36,248 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-12-09 10:18:36,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,324 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-12-09 10:18:36,326 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-12-09 10:18:36,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:36,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2018-12-09 10:18:36,667 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-12-09 10:18:36,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:36,693 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-12-09 10:18:37,827 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-12-09 10:18:37,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:37,830 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-12-09 10:18:37,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12-09 10:18:38,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 128 [2018-12-09 10:18:38,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,191 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:18:38,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,195 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 192 [2018-12-09 10:18:38,195 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2018-12-09 10:18:38,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-12-09 10:18:38,231 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,244 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,341 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-12-09 10:18:38,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,346 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-12-09 10:18:38,347 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,367 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-12-09 10:18:38,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-12-09 10:18:38,371 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,378 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,390 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 114 [2018-12-09 10:18:38,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,467 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 100 treesize of output 134 [2018-12-09 10:18:38,467 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 105 [2018-12-09 10:18:38,544 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2018-12-09 10:18:38,610 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-12-09 10:18:38,611 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,620 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:38,677 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 101 treesize of output 104 [2018-12-09 10:18:38,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, 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-12-09 10:18:38,680 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,692 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2018-12-09 10:18:38,739 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-12-09 10:18:38,739 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,747 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,762 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:38,858 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-12-09 10:18:41,238 WARN L180 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-12-09 10:18:41,242 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-12-09 10:18:41,242 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:41,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:41,653 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-12-09 10:18:41,653 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:41,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:41,657 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-12-09 10:18:41,657 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,024 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-12-09 10:18:42,027 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-12-09 10:18:42,027 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:18:42,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:18:42,048 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,057 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,066 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,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, 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-12-09 10:18:42,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,266 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-12-09 10:18:42,267 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 3 xjuncts. [2018-12-09 10:18:42,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,396 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-12-09 10:18:42,396 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 102 [2018-12-09 10:18:42,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,497 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-12-09 10:18:42,497 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,509 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,588 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-12-09 10:18:42,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,591 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-12-09 10:18:42,591 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,604 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,612 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-12-09 10:18:42,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:18:42,615 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,630 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,677 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-12-09 10:18:42,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,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 56 treesize of output 60 [2018-12-09 10:18:42,680 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,692 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,728 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 10:18:42,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2018-12-09 10:18:42,826 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-12-09 10:18:42,826 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,840 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-12-09 10:18:42,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-09 10:18:42,843 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,848 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,855 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,861 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-12-09 10:18:42,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,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, 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-12-09 10:18:42,865 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,883 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-12-09 10:18:42,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:42,886 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-12-09 10:18:42,886 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,894 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,901 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:42,926 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:42,957 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-12-09 10:18:42,957 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2018-12-09 10:18:43,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-12-09 10:18:43,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-12-09 10:18:43,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-12-09 10:18:43,131 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-12-09 10:18:43,131 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-12-09 10:18:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:18:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-09 10:18:43,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 18 letters. Loop has 5 letters. [2018-12-09 10:18:43,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:18:43,131 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:18:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:18:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:43,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:43,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:43,176 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-12-09 10:18:43,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:43,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:43,193 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-12-09 10:18:43,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 10:18:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:18:43,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:18:43,298 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-12-09 10:18:43,300 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-12-09 10:18:43,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,353 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-12-09 10:18:43,355 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-12-09 10:18:43,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,429 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-12-09 10:18:43,430 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-12-09 10:18:43,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:43,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:43,461 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:232, output treesize:103 [2018-12-09 10:18:43,754 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2018-12-09 10:18:43,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:43,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12-09 10:18:45,079 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 183 DAG size of output: 104 [2018-12-09 10:18:45,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,087 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-12-09 10:18:45,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,268 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-12-09 10:18:45,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 128 [2018-12-09 10:18:45,444 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 10:18:45,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,451 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 192 [2018-12-09 10:18:45,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2018-12-09 10:18:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-12-09 10:18:45,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,608 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-12-09 10:18:45,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,613 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-12-09 10:18:45,613 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,633 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-12-09 10:18:45,636 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-12-09 10:18:45,636 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,642 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,650 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 114 [2018-12-09 10:18:45,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 107 treesize of output 105 [2018-12-09 10:18:45,720 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:45,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 130 [2018-12-09 10:18:45,799 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,877 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 91 treesize of output 78 [2018-12-09 10:18:45,880 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-12-09 10:18:45,880 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,890 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2018-12-09 10:18:45,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 63 treesize of output 61 [2018-12-09 10:18:45,960 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,969 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:45,989 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:46,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:46,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, 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-12-09 10:18:48,923 WARN L180 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 174 DAG size of output: 111 [2018-12-09 10:18:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 114 [2018-12-09 10:18:48,927 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,250 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-12-09 10:18:49,251 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,256 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-12-09 10:18:49,256 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2018-12-09 10:18:49,537 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-12-09 10:18:49,537 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,551 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-12-09 10:18:49,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 40 treesize of output 34 [2018-12-09 10:18:49,554 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,559 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,566 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,573 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-12-09 10:18:49,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,578 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-12-09 10:18:49,578 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,596 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-12-09 10:18:49,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-09 10:18:49,599 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,608 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,617 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,757 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-12-09 10:18:49,761 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-12-09 10:18:49,761 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,852 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-12-09 10:18:49,852 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,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, 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-12-09 10:18:49,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:49,953 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-12-09 10:18:49,953 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:49,966 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:50,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:50,018 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-12-09 10:18:50,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 10:18:50,022 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-12-09 10:18:50,022 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 10:18:50,035 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:50,069 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 10:18:50,125 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 10:18:50,153 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-12-09 10:18:50,153 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 4 variables, input treesize:689, output treesize:185 [2018-12-09 10:18:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:18:50,205 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-09 10:18:50,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 59 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-12-09 10:18:50,317 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-12-09 10:18:50,317 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-12-09 10:18:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 10:18:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2018-12-09 10:18:50,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 5 letters. [2018-12-09 10:18:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:18:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 23 letters. Loop has 5 letters. [2018-12-09 10:18:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:18:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 17 transitions. Stem has 18 letters. Loop has 10 letters. [2018-12-09 10:18:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:18:50,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 108 transitions. [2018-12-09 10:18:50,318 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:18:50,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2018-12-09 10:18:50,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:18:50,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:18:50,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:18:50,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:18:50,319 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:18:50,319 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:18:50,319 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:18:50,319 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 10:18:50,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:18:50,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:18:50,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:18:50,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:18:50 BoogieIcfgContainer [2018-12-09 10:18:50,323 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:18:50,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:18:50,323 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:18:50,323 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:18:50,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:13" (3/4) ... [2018-12-09 10:18:50,326 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:18:50,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:18:50,326 INFO L168 Benchmark]: Toolchain (without parser) took 157504.08 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 950.6 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2018-12-09 10:18:50,327 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:18:50,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:50,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:18:50,327 INFO L168 Benchmark]: Boogie Preprocessor took 13.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:18:50,327 INFO L168 Benchmark]: RCFGBuilder took 169.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:18:50,327 INFO L168 Benchmark]: BuchiAutomizer took 157021.92 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2018-12-09 10:18:50,328 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 7.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:18:50,328 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 169.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 157021.92 ms. Allocated memory was 1.2 GB in the beginning and 7.3 GB in the end (delta: 6.1 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. * Witness Printer took 2.66 ms. Allocated memory is still 7.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (5 trivial, 6 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[y][y] + 1 > 0 then 2 * unknown-#memory_int-unknown[y][y] + 1 else 2 * unknown-#memory_int-unknown[x][x]) and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 156.9s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 99.8s. Construction of modules took 1.4s. Büchi inclusion checks took 55.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 194 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 72 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/5 HoareTripleCheckerStatistics: 58 SDtfs, 273 SDslu, 67 SDs, 0 SdLazy, 1294 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital4610825 mio100 ax100 hnf99 lsp89 ukn5 mio100 lsp36 div100 bol102 ite100 ukn100 eq176 hnf89 smp93 dnf151 smp89 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 226ms 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...