./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/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_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/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 Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: integer overflow --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:55:19,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:55:19,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:55:19,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:55:19,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:55:19,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:55:19,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:55:19,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:55:19,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:55:19,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:55:19,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:55:19,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:55:19,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:55:19,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:55:19,583 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:55:19,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:55:19,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:55:19,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:55:19,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:55:19,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:55:19,589 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:55:19,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:55:19,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:55:19,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:55:19,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:55:19,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:55:19,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:55:19,593 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:55:19,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:55:19,595 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:55:19,595 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:55:19,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:55:19,595 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:55:19,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:55:19,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:55:19,597 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:55:19,597 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 06:55:19,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:55:19,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:55:19,607 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:55:19,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:55:19,607 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:55:19,607 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:55:19,608 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:55:19,608 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:55:19,608 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:55:19,608 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:55:19,608 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:55:19,608 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:55:19,609 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:55:19,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:55:19,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:55:19,609 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:55:19,609 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:55:19,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:55:19,610 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:55:19,610 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:55:19,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:55:19,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:55:19,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:55:19,610 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:55:19,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:55:19,611 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:55:19,611 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:55:19,611 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:55:19,612 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_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3ac7e4caefab280af1b902717cbfa5c070462d8 [2018-11-10 06:55:19,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:55:19,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:55:19,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:55:19,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:55:19,644 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:55:19,645 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2018-11-10 06:55:19,679 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/data/403a0746e/0fa112a8e74344e68cced6bb40bef17d/FLAG1c7546e44 [2018-11-10 06:55:20,001 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:55:20,001 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/sv-benchmarks/c/termination-memory-alloca/min_rf-alloca_true-termination.c.i [2018-11-10 06:55:20,008 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/data/403a0746e/0fa112a8e74344e68cced6bb40bef17d/FLAG1c7546e44 [2018-11-10 06:55:20,016 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/data/403a0746e/0fa112a8e74344e68cced6bb40bef17d [2018-11-10 06:55:20,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:55:20,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:55:20,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:55:20,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:55:20,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:55:20,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20, skipping insertion in model container [2018-11-10 06:55:20,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:55:20,054 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:55:20,225 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:55:20,231 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:55:20,260 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:55:20,283 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:55:20,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20 WrapperNode [2018-11-10 06:55:20,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:55:20,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:55:20,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:55:20,284 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:55:20,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:55:20,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:55:20,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:55:20,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:55:20,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... [2018-11-10 06:55:20,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:55:20,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:55:20,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:55:20,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:55:20,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:55:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:55:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:55:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:55:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:55:20,679 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:55:20,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:55:20 BoogieIcfgContainer [2018-11-10 06:55:20,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:55:20,680 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:55:20,680 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:55:20,683 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:55:20,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:55:20,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:55:20" (1/3) ... [2018-11-10 06:55:20,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a004add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:55:20, skipping insertion in model container [2018-11-10 06:55:20,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:55:20,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:55:20" (2/3) ... [2018-11-10 06:55:20,685 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a004add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:55:20, skipping insertion in model container [2018-11-10 06:55:20,685 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:55:20,685 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:55:20" (3/3) ... [2018-11-10 06:55:20,686 INFO L375 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca_true-termination.c.i [2018-11-10 06:55:20,724 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:55:20,725 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:55:20,725 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:55:20,725 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:55:20,725 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:55:20,725 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:55:20,725 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:55:20,726 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:55:20,726 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:55:20,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-10 06:55:20,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:55:20,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:20,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:20,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:55:20,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:20,759 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:55:20,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-10 06:55:20,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:55:20,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:20,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:20,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:55:20,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:20,769 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 50#L551true SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 51#L551-1true havoc main_#t~nondet5; 11#L552true SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 13#L552-1true havoc main_#t~nondet6; 7#L556-12true [2018-11-10 06:55:20,770 INFO L795 eck$LassoCheckResult]: Loop: 7#L556-12true assume true; 29#L553-1true SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 31#L553-2true main_#t~short9 := main_#t~mem7 > 0; 33#L553-3true assume !main_#t~short9; 22#L553-7true assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 48#L554true SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 42#L554-1true SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 43#L554-2true assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 6#L555true SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 8#L555-1true SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 49#L555-2true havoc main_#t~mem13; 37#L554-7true assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 38#L557true SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 39#L557-1true SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 40#L557-2true SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 41#L557-3true havoc main_#t~mem21;havoc main_#t~mem20; 27#L557-4true SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 30#L557-5true SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 32#L557-6true havoc main_#t~mem22; 34#L557-7true SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 36#L557-8true SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 20#L557-9true SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 21#L557-10true havoc main_#t~mem24;havoc main_#t~mem23; 7#L556-12true [2018-11-10 06:55:20,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-11-10 06:55:20,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:20,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:20,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:20,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1422511911, now seen corresponding path program 1 times [2018-11-10 06:55:20,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:20,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:20,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:55:20,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:55:20,935 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:55:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:55:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:55:20,945 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-11-10 06:55:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:55:20,984 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-10 06:55:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:55:20,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 53 transitions. [2018-11-10 06:55:20,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:55:20,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 47 transitions. [2018-11-10 06:55:20,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 06:55:20,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 06:55:20,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 47 transitions. [2018-11-10 06:55:20,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:55:20,993 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 06:55:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 47 transitions. [2018-11-10 06:55:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-10 06:55:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-10 06:55:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-11-10 06:55:21,013 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 06:55:21,013 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-11-10 06:55:21,013 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:55:21,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 47 transitions. [2018-11-10 06:55:21,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:55:21,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:21,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:21,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:55:21,015 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:21,015 INFO L793 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 124#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 150#L551-1 havoc main_#t~nondet5; 131#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 132#L552-1 havoc main_#t~nondet6; 115#L556-12 [2018-11-10 06:55:21,016 INFO L795 eck$LassoCheckResult]: Loop: 115#L556-12 assume true; 120#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 146#L553-2 main_#t~short9 := main_#t~mem7 > 0; 148#L553-3 assume main_#t~short9; 151#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 137#L553-5 main_#t~short9 := main_#t~mem8 > 0; 138#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 141#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 125#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 126#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 129#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 133#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 135#L554-5 havoc main_#t~mem12; 110#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 112#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 142#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 143#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 127#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 128#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 130#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 134#L556-6 havoc main_#t~mem17; 136#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 108#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 109#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 113#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 115#L556-12 [2018-11-10 06:55:21,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-11-10 06:55:21,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:21,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:21,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:21,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash -605708772, now seen corresponding path program 1 times [2018-11-10 06:55:21,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:21,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:21,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:21,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:21,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:21,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash -864619624, now seen corresponding path program 1 times [2018-11-10 06:55:21,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:21,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:21,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:21,419 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-10 06:55:21,665 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-11-10 06:55:21,755 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:55:21,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:55:21,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:55:21,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:55:21,756 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:55:21,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:55:21,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:55:21,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:55:21,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 06:55:21,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:55:21,757 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:55:21,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:21,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:22,072 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2018-11-10 06:55:22,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:22,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:22,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:22,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:22,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-11-10 06:55:22,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:22,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-11-10 06:55:22,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-11-10 06:55:22,626 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:55:22,631 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:55:22,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-11-10 06:55:22,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:22,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:22,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:22,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,705 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:55:22,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,707 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:55:22,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,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-11-10 06:55:22,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:22,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:22,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:22,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:22,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:22,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:22,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:22,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:22,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:55:22,771 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:55:22,771 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 06:55:22,774 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:55:22,775 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:55:22,775 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:55:22,776 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-10 06:55:22,859 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:55:22,867 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:55:22,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:22,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:22,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:22,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:22,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:22,989 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:22,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:22,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:22,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:22,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:22,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:55:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:23,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:23,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 51 [2018-11-10 06:55:23,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:23,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-11-10 06:55:23,270 INFO L477 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 3 case distinctions, treesize of input 52 treesize of output 64 [2018-11-10 06:55:23,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:23,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:23,280 INFO L477 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 50 treesize of output 59 [2018-11-10 06:55:23,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 47 treesize of output 40 [2018-11-10 06:55:23,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:55:23,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:55:23,360 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:80 [2018-11-10 06:55:23,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:23,421 INFO L477 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 48 treesize of output 51 [2018-11-10 06:55:23,425 INFO L477 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 40 treesize of output 31 [2018-11-10 06:55:23,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:55:23,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:34 [2018-11-10 06:55:23,488 INFO L477 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 36 treesize of output 33 [2018-11-10 06:55:23,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 29 treesize of output 24 [2018-11-10 06:55:23,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:23,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-11-10 06:55:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:23,535 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2018-11-10 06:55:23,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 47 transitions. cyclomatic complexity: 3 Second operand 16 states. [2018-11-10 06:55:23,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 47 transitions. cyclomatic complexity: 3. Second operand 16 states. Result 122 states and 128 transitions. Complement of second has 30 states. [2018-11-10 06:55:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-10 06:55:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 06:55:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-10 06:55:23,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 45 transitions. Stem has 6 letters. Loop has 25 letters. [2018-11-10 06:55:23,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 45 transitions. Stem has 31 letters. Loop has 25 letters. [2018-11-10 06:55:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 45 transitions. Stem has 6 letters. Loop has 50 letters. [2018-11-10 06:55:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:23,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 128 transitions. [2018-11-10 06:55:23,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:55:23,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 103 states and 109 transitions. [2018-11-10 06:55:23,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-10 06:55:23,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-10 06:55:23,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 109 transitions. [2018-11-10 06:55:23,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:23,845 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-11-10 06:55:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 109 transitions. [2018-11-10 06:55:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2018-11-10 06:55:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 06:55:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-11-10 06:55:23,849 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-11-10 06:55:23,849 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-11-10 06:55:23,849 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:55:23,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 94 transitions. [2018-11-10 06:55:23,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 06:55:23,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:23,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:23,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:23,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:23,851 INFO L793 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 566#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 619#L551-1 havoc main_#t~nondet5; 578#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 579#L552-1 havoc main_#t~nondet6; 585#L556-12 assume true; 626#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 628#L553-2 main_#t~short9 := main_#t~mem7 > 0; 627#L553-3 assume main_#t~short9; 624#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 625#L553-5 main_#t~short9 := main_#t~mem8 > 0; 601#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 602#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 567#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 568#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 557#L555 [2018-11-10 06:55:23,851 INFO L795 eck$LassoCheckResult]: Loop: 557#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 558#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 563#L555-2 havoc main_#t~mem13; 611#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 550#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 553#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 556#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 559#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 564#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 612#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 616#L557-6 havoc main_#t~mem22; 620#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 623#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 599#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 600#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 560#L556-12 assume true; 561#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 614#L553-2 main_#t~short9 := main_#t~mem7 > 0; 617#L553-3 assume main_#t~short9; 621#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 595#L553-5 main_#t~short9 := main_#t~mem8 > 0; 596#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 609#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 610#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 575#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 557#L555 [2018-11-10 06:55:23,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash 952988564, now seen corresponding path program 1 times [2018-11-10 06:55:23,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:23,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:23,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash 590067610, now seen corresponding path program 1 times [2018-11-10 06:55:23,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:23,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:23,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:23,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash 723541863, now seen corresponding path program 1 times [2018-11-10 06:55:23,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:24,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:55:24,287 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:55:24,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:24,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:24,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:24,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:24,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:24,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:24,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:24,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-10 06:55:24,402 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:55:24,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:24,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 06:55:24,417 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:55:24,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:24,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 06:55:24,565 INFO L477 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 30 treesize of output 39 [2018-11-10 06:55:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:24,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2018-11-10 06:55:24,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-10 06:55:24,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 27 [2018-11-10 06:55:24,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:41 [2018-11-10 06:55:24,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:24,785 INFO L477 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 49 treesize of output 62 [2018-11-10 06:55:24,790 INFO L477 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 43 treesize of output 36 [2018-11-10 06:55:24,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:55:24,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:24,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:39 [2018-11-10 06:55:24,849 INFO L477 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 40 treesize of output 45 [2018-11-10 06:55:24,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 33 treesize of output 28 [2018-11-10 06:55:24,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:24,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:24,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:24,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:23 [2018-11-10 06:55:25,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-10 06:55:25,111 INFO L477 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 13 treesize of output 9 [2018-11-10 06:55:25,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:25,121 INFO L477 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 12 [2018-11-10 06:55:25,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:25,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:25,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:25,129 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:44, output treesize:14 [2018-11-10 06:55:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:25,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:55:25,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2018-11-10 06:55:25,355 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2018-11-10 06:55:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 06:55:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1359, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 06:55:25,398 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. cyclomatic complexity: 7 Second operand 39 states. [2018-11-10 06:55:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:55:26,750 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-11-10 06:55:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 06:55:26,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 134 transitions. [2018-11-10 06:55:26,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-11-10 06:55:26,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 134 transitions. [2018-11-10 06:55:26,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-10 06:55:26,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-10 06:55:26,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 134 transitions. [2018-11-10 06:55:26,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:26,753 INFO L705 BuchiCegarLoop]: Abstraction has 127 states and 134 transitions. [2018-11-10 06:55:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 134 transitions. [2018-11-10 06:55:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-11-10 06:55:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 06:55:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-11-10 06:55:26,757 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-11-10 06:55:26,757 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-11-10 06:55:26,757 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:55:26,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 117 transitions. [2018-11-10 06:55:26,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-10 06:55:26,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:26,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:26,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:26,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:26,760 INFO L793 eck$LassoCheckResult]: Stem: 1039#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 995#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 996#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 1044#L551-1 havoc main_#t~nondet5; 1005#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 1006#L552-1 havoc main_#t~nondet6; 1012#L556-12 assume true; 991#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 1040#L553-2 main_#t~short9 := main_#t~mem7 > 0; 1045#L553-3 assume main_#t~short9; 1048#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 1023#L553-5 main_#t~short9 := main_#t~mem8 > 0; 1024#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 1030#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 997#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 998#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 987#L555 [2018-11-10 06:55:26,760 INFO L795 eck$LassoCheckResult]: Loop: 987#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 988#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 993#L555-2 havoc main_#t~mem13; 1037#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 1032#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 1033#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 1035#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 1001#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 1002#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 1010#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 1015#L556-6 havoc main_#t~mem17; 1019#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 1083#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 1082#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 1081#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 1029#L556-12 assume true; 1080#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 1079#L553-2 main_#t~short9 := main_#t~mem7 > 0; 1078#L553-3 assume main_#t~short9; 1077#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 1076#L553-5 main_#t~short9 := main_#t~mem8 > 0; 1075#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 1074#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1073#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 1051#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 987#L555 [2018-11-10 06:55:26,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash 952988564, now seen corresponding path program 2 times [2018-11-10 06:55:26,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:26,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:26,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:26,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash -728009254, now seen corresponding path program 1 times [2018-11-10 06:55:26,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:26,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:26,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:26,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:26,792 INFO L82 PathProgramCache]: Analyzing trace with hash -594535001, now seen corresponding path program 1 times [2018-11-10 06:55:26,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:26,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:26,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:27,026 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2018-11-10 06:55:27,241 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2018-11-10 06:55:27,311 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:55:27,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:55:27,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:55:27,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:55:27,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:55:27,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:55:27,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:55:27,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:55:27,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 06:55:27,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:55:27,312 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:55:27,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,570 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2018-11-10 06:55:27,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-11-10 06:55:27,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-11-10 06:55:27,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-11-10 06:55:27,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-11-10 06:55:27,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-11-10 06:55:27,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:27,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:28,020 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:55:28,020 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:55:28,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:28,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:28,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:28,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,062 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:55:28,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,062 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:55:28,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,066 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:55:28,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:55:28,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:28,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:28,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:28,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:28,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:28,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:28,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:28,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:28,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:55:28,089 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:55:28,089 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:55:28,089 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:55:28,090 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:55:28,090 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:55:28,090 INFO L519 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-11-10 06:55:28,164 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:55:28,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:55:28,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:28,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:28,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:28,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:28,229 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:28,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:28,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:28,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:55:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:28,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:28,281 INFO L477 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 26 treesize of output 27 [2018-11-10 06:55:28,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:28,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-10 06:55:28,329 INFO L477 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 3 case distinctions, treesize of input 32 treesize of output 50 [2018-11-10 06:55:28,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 2 case distinctions, treesize of input 36 treesize of output 42 [2018-11-10 06:55:28,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:55:28,373 INFO L477 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 29 treesize of output 28 [2018-11-10 06:55:28,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:55:28,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:55:28,406 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:47 [2018-11-10 06:55:28,456 INFO L477 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 35 treesize of output 36 [2018-11-10 06:55:28,458 INFO L477 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 10 treesize of output 9 [2018-11-10 06:55:28,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:28,485 INFO L477 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 47 treesize of output 48 [2018-11-10 06:55:28,488 INFO L477 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 33 treesize of output 26 [2018-11-10 06:55:28,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 06:55:28,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:55:28,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:58 [2018-11-10 06:55:28,537 INFO L477 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 34 treesize of output 31 [2018-11-10 06:55:28,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:28,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:28,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:18 [2018-11-10 06:55:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:28,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-10 06:55:28,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 117 transitions. cyclomatic complexity: 8 Second operand 12 states. [2018-11-10 06:55:28,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 117 transitions. cyclomatic complexity: 8. Second operand 12 states. Result 224 states and 236 transitions. Complement of second has 24 states. [2018-11-10 06:55:28,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 06:55:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:55:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-10 06:55:28,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 16 letters. Loop has 25 letters. [2018-11-10 06:55:28,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:28,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 41 letters. Loop has 25 letters. [2018-11-10 06:55:28,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:28,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 16 letters. Loop has 50 letters. [2018-11-10 06:55:28,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:28,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 236 transitions. [2018-11-10 06:55:28,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97 [2018-11-10 06:55:28,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 193 states and 205 transitions. [2018-11-10 06:55:28,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-10 06:55:28,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-10 06:55:28,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 205 transitions. [2018-11-10 06:55:28,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:28,854 INFO L705 BuchiCegarLoop]: Abstraction has 193 states and 205 transitions. [2018-11-10 06:55:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 205 transitions. [2018-11-10 06:55:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-11-10 06:55:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 06:55:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-11-10 06:55:28,860 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-11-10 06:55:28,860 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-11-10 06:55:28,860 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:55:28,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 190 transitions. [2018-11-10 06:55:28,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 97 [2018-11-10 06:55:28,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:28,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:28,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:28,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:28,862 INFO L793 eck$LassoCheckResult]: Stem: 1671#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1619#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1620#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 1682#L551-1 havoc main_#t~nondet5; 1635#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 1636#L552-1 havoc main_#t~nondet6; 1639#L556-12 assume true; 1613#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 1679#L553-2 main_#t~short9 := main_#t~mem7 > 0; 1680#L553-3 assume main_#t~short9; 1684#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 1687#L553-5 main_#t~short9 := main_#t~mem8 > 0; 1764#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 1666#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1625#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 1626#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 1689#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 1610#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 1617#L555-2 havoc main_#t~mem13; 1599#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 1600#L557 [2018-11-10 06:55:28,862 INFO L795 eck$LassoCheckResult]: Loop: 1600#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 1603#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 1728#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 1727#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 1726#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 1725#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 1724#L557-6 havoc main_#t~mem22; 1723#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 1722#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 1721#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 1720#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 1719#L556-12 assume true; 1718#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 1717#L553-2 main_#t~short9 := main_#t~mem7 > 0; 1716#L553-3 assume main_#t~short9; 1715#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 1714#L553-5 main_#t~short9 := main_#t~mem8 > 0; 1713#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 1712#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1711#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 1632#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 1633#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 1640#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 1645#L554-5 havoc main_#t~mem12; 1648#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 1754#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 1753#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 1749#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 1621#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 1622#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 1746#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 1745#L556-6 havoc main_#t~mem17; 1743#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 1741#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 1740#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 1738#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 1736#L556-12 assume true; 1735#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 1734#L553-2 main_#t~short9 := main_#t~mem7 > 0; 1733#L553-3 assume main_#t~short9; 1732#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 1731#L553-5 main_#t~short9 := main_#t~mem8 > 0; 1730#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 1729#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1710#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 1708#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 1709#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 1756#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 1668#L555-2 havoc main_#t~mem13; 1669#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 1600#L557 [2018-11-10 06:55:28,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:28,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1729294054, now seen corresponding path program 1 times [2018-11-10 06:55:28,863 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:28,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:28,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -385848415, now seen corresponding path program 1 times [2018-11-10 06:55:28,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:28,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:28,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:28,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:28,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1756198726, now seen corresponding path program 1 times [2018-11-10 06:55:28,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:28,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:28,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:28,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:28,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:30,096 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 178 DAG size of output: 156 [2018-11-10 06:55:30,216 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-10 06:55:30,412 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2018-11-10 06:55:30,481 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:55:30,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:55:30,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:55:30,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:55:30,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:55:30,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:55:30,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:55:30,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:55:30,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 06:55:30,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:55:30,482 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:55:30,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,728 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 06:55:30,926 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-10 06:55:30,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:30,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:31,352 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:55:31,352 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:55:31,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:31,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:31,353 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:55:31,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:31,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:31,354 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:55:31,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:31,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:31,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:31,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:31,360 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:55:31,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:31,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:31,361 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:55:31,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:31,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:31,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:31,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:31,364 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:55:31,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:31,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:31,365 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:55:31,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:31,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:31,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:31,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:31,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:31,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:31,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:31,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:31,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:31,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:31,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:31,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:31,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:31,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:31,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:31,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:31,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:31,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:55:31,384 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:55:31,384 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:55:31,384 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:55:31,385 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:55:31,385 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:55:31,385 INFO L519 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2018-11-10 06:55:31,473 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:55:31,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:55:31,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:31,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:31,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:31,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:31,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:31,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:31,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:31,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:55:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:31,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:31,554 INFO L477 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 21 treesize of output 22 [2018-11-10 06:55:31,555 INFO L477 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 10 treesize of output 9 [2018-11-10 06:55:31,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2018-11-10 06:55:31,579 INFO L477 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 28 treesize of output 29 [2018-11-10 06:55:31,581 INFO L477 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 10 treesize of output 9 [2018-11-10 06:55:31,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:55:31,606 INFO L477 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 34 treesize of output 31 [2018-11-10 06:55:31,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:31,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:55:31,641 INFO L477 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 28 treesize of output 29 [2018-11-10 06:55:31,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:31,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:55:31,668 INFO L477 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 34 treesize of output 31 [2018-11-10 06:55:31,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:31,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:18 [2018-11-10 06:55:31,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 06:55:31,706 INFO L477 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 10 treesize of output 9 [2018-11-10 06:55:31,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-11-10 06:55:31,735 INFO L477 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 36 treesize of output 33 [2018-11-10 06:55:31,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 29 treesize of output 24 [2018-11-10 06:55:31,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:18 [2018-11-10 06:55:31,828 INFO L477 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 35 treesize of output 36 [2018-11-10 06:55:31,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:31,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:31,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:31,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:55:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:31,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 15 loop predicates [2018-11-10 06:55:31,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 190 transitions. cyclomatic complexity: 15 Second operand 18 states. [2018-11-10 06:55:32,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 190 transitions. cyclomatic complexity: 15. Second operand 18 states. Result 645 states and 680 transitions. Complement of second has 44 states. [2018-11-10 06:55:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 20 non-accepting loop states 1 accepting loop states [2018-11-10 06:55:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 06:55:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 128 transitions. [2018-11-10 06:55:32,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 128 transitions. Stem has 20 letters. Loop has 50 letters. [2018-11-10 06:55:32,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:32,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 128 transitions. Stem has 70 letters. Loop has 50 letters. [2018-11-10 06:55:32,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:32,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 128 transitions. Stem has 20 letters. Loop has 100 letters. [2018-11-10 06:55:32,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:32,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 645 states and 680 transitions. [2018-11-10 06:55:32,592 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 176 [2018-11-10 06:55:32,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 645 states to 579 states and 613 transitions. [2018-11-10 06:55:32,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2018-11-10 06:55:32,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 346 [2018-11-10 06:55:32,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 579 states and 613 transitions. [2018-11-10 06:55:32,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:32,595 INFO L705 BuchiCegarLoop]: Abstraction has 579 states and 613 transitions. [2018-11-10 06:55:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states and 613 transitions. [2018-11-10 06:55:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 447. [2018-11-10 06:55:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-10 06:55:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 477 transitions. [2018-11-10 06:55:32,614 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 477 transitions. [2018-11-10 06:55:32,614 INFO L608 BuchiCegarLoop]: Abstraction has 447 states and 477 transitions. [2018-11-10 06:55:32,614 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:55:32,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 477 transitions. [2018-11-10 06:55:32,615 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 176 [2018-11-10 06:55:32,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:32,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:32,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:32,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:32,616 INFO L793 eck$LassoCheckResult]: Stem: 2918#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2865#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 2923#L551-1 havoc main_#t~nondet5; 2874#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 2875#L552-1 havoc main_#t~nondet6; 2881#L556-12 assume true; 2958#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 3066#L553-2 main_#t~short9 := main_#t~mem7 > 0; 3065#L553-3 assume main_#t~short9; 3064#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 3063#L553-5 main_#t~short9 := main_#t~mem8 > 0; 3062#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 3061#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 3060#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 3058#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 3057#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 3056#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 3055#L554-5 havoc main_#t~mem12; 3054#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 3052#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 3053#L557-1 [2018-11-10 06:55:32,617 INFO L795 eck$LassoCheckResult]: Loop: 3053#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 3151#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 3150#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 3149#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 3148#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 3147#L557-6 havoc main_#t~mem22; 3146#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 3144#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 3123#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 3091#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 3092#L556-12 assume true; 3087#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 3088#L553-2 main_#t~short9 := main_#t~mem7 > 0; 3083#L553-3 assume main_#t~short9; 3084#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 3079#L553-5 main_#t~short9 := main_#t~mem8 > 0; 3080#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 3075#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 3076#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 3071#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 3072#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 3143#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 3142#L554-5 havoc main_#t~mem12; 3140#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 3141#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 3053#L557-1 [2018-11-10 06:55:32,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1920591059, now seen corresponding path program 1 times [2018-11-10 06:55:32,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:32,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:32,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:32,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1976285874, now seen corresponding path program 1 times [2018-11-10 06:55:32,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:32,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:32,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1614772704, now seen corresponding path program 1 times [2018-11-10 06:55:32,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:32,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:32,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:32,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:32,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:32,890 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-10 06:55:33,185 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2018-11-10 06:55:33,291 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-10 06:55:33,293 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:55:33,294 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:55:33,294 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:55:33,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:55:33,294 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:55:33,294 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:55:33,294 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:55:33,294 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:55:33,294 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 06:55:33,294 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:55:33,294 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:55:33,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,593 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-10 06:55:33,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:33,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:55:34,055 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:55:34,055 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:55:34,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:34,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:34,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:34,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:34,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:34,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:34,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:55:34,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,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-11-10 06:55:34,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:34,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:34,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,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-11-10 06:55:34,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,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-11-10 06:55:34,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:55:34,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:55:34,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:55:34,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:55:34,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-11-10 06:55:34,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:55:34,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:55:34,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:55:34,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:55:34,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:55:34,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:55:34,100 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:55:34,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:55:34,107 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:55:34,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:55:34,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:55:34,109 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:55:34,109 INFO L519 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)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_4 Supporting invariants [] [2018-11-10 06:55:34,230 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:55:34,233 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:55:34,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:34,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:34,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:34,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:34,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:34,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:34,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:55:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:34,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:34,336 INFO L477 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 21 treesize of output 22 [2018-11-10 06:55:34,340 INFO L477 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 10 treesize of output 9 [2018-11-10 06:55:34,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:55:34,371 INFO L477 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 28 treesize of output 29 [2018-11-10 06:55:34,376 INFO L477 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 10 treesize of output 9 [2018-11-10 06:55:34,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:55:34,405 INFO L477 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 34 treesize of output 31 [2018-11-10 06:55:34,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:34,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:55:34,486 INFO L477 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 35 treesize of output 36 [2018-11-10 06:55:34,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:34,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:34,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:34,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:55:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:34,515 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:55:34,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 447 states and 477 transitions. cyclomatic complexity: 40 Second operand 12 states. [2018-11-10 06:55:34,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 447 states and 477 transitions. cyclomatic complexity: 40. Second operand 12 states. Result 738 states and 779 transitions. Complement of second has 24 states. [2018-11-10 06:55:34,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 06:55:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:55:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-10 06:55:34,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 21 letters. Loop has 25 letters. [2018-11-10 06:55:34,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:34,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 46 letters. Loop has 25 letters. [2018-11-10 06:55:34,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:34,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 83 transitions. Stem has 21 letters. Loop has 50 letters. [2018-11-10 06:55:34,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:55:34,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 738 states and 779 transitions. [2018-11-10 06:55:34,833 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 151 [2018-11-10 06:55:34,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 738 states to 609 states and 646 transitions. [2018-11-10 06:55:34,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2018-11-10 06:55:34,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2018-11-10 06:55:34,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 609 states and 646 transitions. [2018-11-10 06:55:34,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:34,836 INFO L705 BuchiCegarLoop]: Abstraction has 609 states and 646 transitions. [2018-11-10 06:55:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states and 646 transitions. [2018-11-10 06:55:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 546. [2018-11-10 06:55:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-11-10 06:55:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 581 transitions. [2018-11-10 06:55:34,848 INFO L728 BuchiCegarLoop]: Abstraction has 546 states and 581 transitions. [2018-11-10 06:55:34,848 INFO L608 BuchiCegarLoop]: Abstraction has 546 states and 581 transitions. [2018-11-10 06:55:34,848 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:55:34,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 546 states and 581 transitions. [2018-11-10 06:55:34,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 151 [2018-11-10 06:55:34,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:34,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:34,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:34,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:34,854 INFO L793 eck$LassoCheckResult]: Stem: 4403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 4349#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 4413#L551-1 havoc main_#t~nondet5; 4363#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 4364#L552-1 havoc main_#t~nondet6; 4370#L556-12 assume true; 4515#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 4511#L553-2 main_#t~short9 := main_#t~mem7 > 0; 4507#L553-3 assume main_#t~short9; 4493#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 4494#L553-5 main_#t~short9 := main_#t~mem8 > 0; 4476#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 4477#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 4468#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 4469#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 4491#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 4716#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 4742#L555-2 havoc main_#t~mem13; 4741#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 4740#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 4738#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 4736#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 4630#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 4631#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 4626#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 4627#L556-6 havoc main_#t~mem17; 4622#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 4623#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 4441#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 4442#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 4437#L556-12 assume true; 4438#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 4433#L553-2 main_#t~short9 := main_#t~mem7 > 0; 4434#L553-3 assume main_#t~short9; 4429#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 4430#L553-5 main_#t~short9 := main_#t~mem8 > 0; 4425#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 4426#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 4719#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 4708#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 4707#L554-3 [2018-11-10 06:55:34,854 INFO L795 eck$LassoCheckResult]: Loop: 4707#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 4706#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 4702#L554-5 havoc main_#t~mem12; 4703#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 4739#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 4737#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 4735#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 4734#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 4733#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 4732#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 4731#L556-6 havoc main_#t~mem17; 4730#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 4729#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 4728#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 4727#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 4726#L556-12 assume true; 4725#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 4724#L553-2 main_#t~short9 := main_#t~mem7 > 0; 4723#L553-3 assume main_#t~short9; 4722#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 4721#L553-5 main_#t~short9 := main_#t~mem8 > 0; 4720#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 4717#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 4712#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 4713#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 4707#L554-3 [2018-11-10 06:55:34,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash -594535006, now seen corresponding path program 1 times [2018-11-10 06:55:34,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:34,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:35,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:55:35,074 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:55:35,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:35,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:35,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:35,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:35,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:35,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:35,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-10 06:55:35,132 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:55:35,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:35,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 06:55:35,141 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:55:35,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:35,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 06:55:35,217 INFO L477 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 30 treesize of output 39 [2018-11-10 06:55:35,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:35,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2018-11-10 06:55:35,319 INFO L477 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 55 [2018-11-10 06:55:35,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 25 treesize of output 20 [2018-11-10 06:55:35,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:37 [2018-11-10 06:55:35,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:35,412 INFO L477 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 45 treesize of output 58 [2018-11-10 06:55:35,414 INFO L477 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 39 treesize of output 32 [2018-11-10 06:55:35,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:35,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:35,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:35,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:42 [2018-11-10 06:55:35,478 INFO L477 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 43 treesize of output 48 [2018-11-10 06:55:35,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:35,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:35,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:23 [2018-11-10 06:55:35,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-10 06:55:35,713 INFO L477 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 13 treesize of output 9 [2018-11-10 06:55:35,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,720 INFO L477 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 12 [2018-11-10 06:55:35,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:35,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:35,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:44, output treesize:14 [2018-11-10 06:55:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:35,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:55:35,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-10 06:55:35,774 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:55:35,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash -525718480, now seen corresponding path program 2 times [2018-11-10 06:55:35,775 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:35,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:35,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:35,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:35,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:35,993 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2018-11-10 06:55:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 06:55:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 06:55:36,047 INFO L87 Difference]: Start difference. First operand 546 states and 581 transitions. cyclomatic complexity: 47 Second operand 35 states. [2018-11-10 06:55:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:55:37,457 INFO L93 Difference]: Finished difference Result 593 states and 623 transitions. [2018-11-10 06:55:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 06:55:37,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 593 states and 623 transitions. [2018-11-10 06:55:37,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 159 [2018-11-10 06:55:37,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 593 states to 593 states and 623 transitions. [2018-11-10 06:55:37,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2018-11-10 06:55:37,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2018-11-10 06:55:37,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 623 transitions. [2018-11-10 06:55:37,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:37,464 INFO L705 BuchiCegarLoop]: Abstraction has 593 states and 623 transitions. [2018-11-10 06:55:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 623 transitions. [2018-11-10 06:55:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 526. [2018-11-10 06:55:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-11-10 06:55:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 554 transitions. [2018-11-10 06:55:37,471 INFO L728 BuchiCegarLoop]: Abstraction has 526 states and 554 transitions. [2018-11-10 06:55:37,472 INFO L608 BuchiCegarLoop]: Abstraction has 526 states and 554 transitions. [2018-11-10 06:55:37,472 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:55:37,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 526 states and 554 transitions. [2018-11-10 06:55:37,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 143 [2018-11-10 06:55:37,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:37,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:37,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:37,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:37,475 INFO L793 eck$LassoCheckResult]: Stem: 5772#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 5714#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 5782#L551-1 havoc main_#t~nondet5; 5728#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 5729#L552-1 havoc main_#t~nondet6; 5735#L556-12 assume true; 5836#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 6006#L553-2 main_#t~short9 := main_#t~mem7 > 0; 6005#L553-3 assume main_#t~short9; 6004#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 6003#L553-5 main_#t~short9 := main_#t~mem8 > 0; 6002#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 6001#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 6000#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 5998#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 5997#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 5996#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 5995#L554-5 havoc main_#t~mem12; 5994#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 5992#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 5993#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 5958#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 5954#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 5955#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 5948#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 5949#L557-6 havoc main_#t~mem22; 5942#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 5943#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 5936#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 5937#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 6024#L556-12 assume true; 6023#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 6022#L553-2 main_#t~short9 := main_#t~mem7 > 0; 6021#L553-3 assume main_#t~short9; 6020#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 6019#L553-5 main_#t~short9 := main_#t~mem8 > 0; 6018#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 5838#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 5837#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 5723#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 5724#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 5699#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 5708#L555-2 havoc main_#t~mem13; 6127#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 6122#L557 [2018-11-10 06:55:37,475 INFO L795 eck$LassoCheckResult]: Loop: 6122#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 6121#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 6120#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 6119#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 6118#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 6100#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 6096#L557-6 havoc main_#t~mem22; 6092#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 6088#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 6084#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 6080#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 6078#L556-12 assume true; 6077#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 6076#L553-2 main_#t~short9 := main_#t~mem7 > 0; 6075#L553-3 assume main_#t~short9; 6074#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 6073#L553-5 main_#t~short9 := main_#t~mem8 > 0; 6072#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 6071#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 6070#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 6069#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 6068#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 6067#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 6066#L554-5 havoc main_#t~mem12; 6064#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 6065#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 6112#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 6109#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 6106#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 6103#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 6099#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 6095#L557-6 havoc main_#t~mem22; 6091#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 6087#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 6083#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 6079#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 6049#L556-12 assume true; 6050#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 6045#L553-2 main_#t~short9 := main_#t~mem7 > 0; 6046#L553-3 assume main_#t~short9; 6041#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 6042#L553-5 main_#t~short9 := main_#t~mem8 > 0; 6037#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 6038#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 6016#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 6017#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 6012#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 6011#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 5959#L555-2 havoc main_#t~mem13; 5960#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 6122#L557 [2018-11-10 06:55:37,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 922513401, now seen corresponding path program 1 times [2018-11-10 06:55:37,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:37,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:37,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:37,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:55:37,806 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:55:37,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:37,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:37,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:37,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:37,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:37,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:37,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:37,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-10 06:55:37,858 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:55:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:37,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 06:55:37,867 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 06:55:37,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:37,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 06:55:37,969 INFO L477 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 32 treesize of output 41 [2018-11-10 06:55:37,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:37,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:37,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-11-10 06:55:38,073 INFO L477 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 52 treesize of output 57 [2018-11-10 06:55:38,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:38,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:39 [2018-11-10 06:55:38,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:38,153 INFO L477 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 47 treesize of output 60 [2018-11-10 06:55:38,155 INFO L477 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 41 treesize of output 34 [2018-11-10 06:55:38,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:38,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:38,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:38,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-11-10 06:55:38,217 INFO L477 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 45 treesize of output 50 [2018-11-10 06:55:38,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:55:38,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:38,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:25 [2018-11-10 06:55:38,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-10 06:55:38,489 INFO L477 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 15 treesize of output 11 [2018-11-10 06:55:38,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,500 INFO L477 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 12 [2018-11-10 06:55:38,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:38,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:38,513 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:16 [2018-11-10 06:55:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:55:38,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:55:38,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2018-11-10 06:55:38,586 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:55:38,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 236572001, now seen corresponding path program 1 times [2018-11-10 06:55:38,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:39,858 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 177 DAG size of output: 148 [2018-11-10 06:55:40,018 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-10 06:55:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-10 06:55:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 06:55:40,019 INFO L87 Difference]: Start difference. First operand 526 states and 554 transitions. cyclomatic complexity: 39 Second operand 38 states. [2018-11-10 06:55:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:55:41,856 INFO L93 Difference]: Finished difference Result 721 states and 753 transitions. [2018-11-10 06:55:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-10 06:55:41,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 721 states and 753 transitions. [2018-11-10 06:55:41,861 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 195 [2018-11-10 06:55:41,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 721 states to 669 states and 699 transitions. [2018-11-10 06:55:41,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2018-11-10 06:55:41,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2018-11-10 06:55:41,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 669 states and 699 transitions. [2018-11-10 06:55:41,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:41,864 INFO L705 BuchiCegarLoop]: Abstraction has 669 states and 699 transitions. [2018-11-10 06:55:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states and 699 transitions. [2018-11-10 06:55:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 462. [2018-11-10 06:55:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-10 06:55:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 486 transitions. [2018-11-10 06:55:41,871 INFO L728 BuchiCegarLoop]: Abstraction has 462 states and 486 transitions. [2018-11-10 06:55:41,871 INFO L608 BuchiCegarLoop]: Abstraction has 462 states and 486 transitions. [2018-11-10 06:55:41,871 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 06:55:41,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 486 transitions. [2018-11-10 06:55:41,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 142 [2018-11-10 06:55:41,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:41,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:41,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:41,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:41,874 INFO L793 eck$LassoCheckResult]: Stem: 7273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 7208#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 7279#L551-1 havoc main_#t~nondet5; 7217#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 7218#L552-1 havoc main_#t~nondet6; 7224#L556-12 assume true; 7316#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 7317#L553-2 main_#t~short9 := main_#t~mem7 > 0; 7312#L553-3 assume main_#t~short9; 7313#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 7308#L553-5 main_#t~short9 := main_#t~mem8 > 0; 7309#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 7304#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 7305#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 7299#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 7300#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 7201#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 7202#L555-2 havoc main_#t~mem13; 7596#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 7595#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 7186#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 7187#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 7619#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 7618#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 7617#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 7615#L557-6 havoc main_#t~mem22; 7613#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 7611#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 7610#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 7609#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 7607#L556-12 assume true; 7605#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 7604#L553-2 main_#t~short9 := main_#t~mem7 > 0; 7603#L553-3 assume main_#t~short9; 7602#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 7601#L553-5 main_#t~short9 := main_#t~mem8 > 0; 7599#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 7597#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 7211#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 7212#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 7220#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 7226#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 7231#L554-5 havoc main_#t~mem12; 7238#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 7478#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 7475#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 7472#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 7471#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 7470#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 7469#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 7468#L556-6 havoc main_#t~mem17; 7467#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 7466#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 7465#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 7182#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 7183#L556-12 [2018-11-10 06:55:41,874 INFO L795 eck$LassoCheckResult]: Loop: 7183#L556-12 assume true; 7571#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 7570#L553-2 main_#t~short9 := main_#t~mem7 > 0; 7286#L553-3 assume main_#t~short9; 7287#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 7561#L553-5 main_#t~short9 := main_#t~mem8 > 0; 7254#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 7255#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 7209#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 7210#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 7219#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 7225#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 7230#L554-5 havoc main_#t~mem12; 7542#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 7172#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 7179#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 7193#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 7194#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 7205#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 7271#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 7277#L557-6 havoc main_#t~mem22; 7283#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 7290#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 7248#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 7249#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 7183#L556-12 [2018-11-10 06:55:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2110424933, now seen corresponding path program 2 times [2018-11-10 06:55:41,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:41,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:55:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -876015652, now seen corresponding path program 2 times [2018-11-10 06:55:41,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:41,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:41,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:41,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash -654778120, now seen corresponding path program 3 times [2018-11-10 06:55:41,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:41,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:41,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:55:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 06:55:42,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:55:42,221 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dfe5b5a5-5dbc-41ea-92d1-98952c8ece52/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:55:42,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:55:42,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 06:55:42,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:55:42,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:55:42,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:42,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:55:42,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:42,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:42,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:55:42,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-10 06:55:42,339 INFO L477 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 32 treesize of output 41 [2018-11-10 06:55:42,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:55:42,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-11-10 06:55:42,434 INFO L477 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 52 treesize of output 55 [2018-11-10 06:55:42,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-10 06:55:42,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:43 [2018-11-10 06:55:42,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:55:42,515 INFO L477 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 51 treesize of output 64 [2018-11-10 06:55:42,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-10 06:55:42,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:55:42,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:41 [2018-11-10 06:55:42,574 INFO L477 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 47 [2018-11-10 06:55:42,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 30 [2018-11-10 06:55:42,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:42,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:42,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:42,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:25 [2018-11-10 06:55:42,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-10 06:55:42,736 INFO L477 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 13 treesize of output 9 [2018-11-10 06:55:42,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-10 06:55:42,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:55:42,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:55:42,754 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:16 [2018-11-10 06:55:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 06:55:42,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:55:42,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2018-11-10 06:55:42,988 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2018-11-10 06:55:43,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 06:55:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 06:55:43,028 INFO L87 Difference]: Start difference. First operand 462 states and 486 transitions. cyclomatic complexity: 35 Second operand 35 states. [2018-11-10 06:55:51,683 WARN L179 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-11-10 06:55:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:55:51,835 INFO L93 Difference]: Finished difference Result 496 states and 516 transitions. [2018-11-10 06:55:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 06:55:51,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 496 states and 516 transitions. [2018-11-10 06:55:51,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 109 [2018-11-10 06:55:51,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 496 states to 383 states and 399 transitions. [2018-11-10 06:55:51,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-10 06:55:51,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-11-10 06:55:51,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 399 transitions. [2018-11-10 06:55:51,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:55:51,837 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 399 transitions. [2018-11-10 06:55:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 399 transitions. [2018-11-10 06:55:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 320. [2018-11-10 06:55:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-10 06:55:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 333 transitions. [2018-11-10 06:55:51,842 INFO L728 BuchiCegarLoop]: Abstraction has 320 states and 333 transitions. [2018-11-10 06:55:51,842 INFO L608 BuchiCegarLoop]: Abstraction has 320 states and 333 transitions. [2018-11-10 06:55:51,842 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 06:55:51,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 333 transitions. [2018-11-10 06:55:51,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2018-11-10 06:55:51,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:55:51,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:55:51,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:51,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:55:51,845 INFO L793 eck$LassoCheckResult]: Stem: 8531#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 8463#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 8548#L551-1 havoc main_#t~nondet5; 8477#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 8478#L552-1 havoc main_#t~nondet6; 8486#L556-12 assume true; 8693#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 8692#L553-2 main_#t~short9 := main_#t~mem7 > 0; 8691#L553-3 assume main_#t~short9; 8690#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 8689#L553-5 main_#t~short9 := main_#t~mem8 > 0; 8688#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 8687#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 8686#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 8685#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 8684#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 8683#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 8682#L554-5 havoc main_#t~mem12; 8681#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 8679#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 8678#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 8677#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 8460#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 8461#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 8538#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 8539#L557-6 havoc main_#t~mem22; 8555#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 8556#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 8507#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 8508#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 8583#L556-12 assume true; 8584#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 8579#L553-2 main_#t~short9 := main_#t~mem7 > 0; 8580#L553-3 assume main_#t~short9; 8575#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 8576#L553-5 main_#t~short9 := main_#t~mem8 > 0; 8571#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 8572#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 8567#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 8568#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 8484#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 8485#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 8498#L554-5 havoc main_#t~mem12; 8500#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 8651#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 8649#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 8643#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 8644#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 8639#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 8640#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 8635#L556-6 havoc main_#t~mem17; 8636#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 8427#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 8428#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 8440#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 8441#L556-12 assume true; 8534#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 8535#L553-2 main_#t~short9 := main_#t~mem7 > 0; 8615#L553-3 assume main_#t~short9; 8616#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 8503#L553-5 main_#t~short9 := main_#t~mem8 > 0; 8504#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 8597#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 8598#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 8593#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 8594#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 8589#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 8590#L555-2 havoc main_#t~mem13; 8738#L554-7 [2018-11-10 06:55:51,845 INFO L795 eck$LassoCheckResult]: Loop: 8738#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 8744#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 8743#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 8448#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 8449#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 8527#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 8528#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 8544#L557-6 havoc main_#t~mem22; 8545#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 8561#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 8562#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 8509#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 8510#L556-12 assume true; 8532#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 8533#L553-2 main_#t~short9 := main_#t~mem7 > 0; 8549#L553-3 assume main_#t~short9; 8550#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 8607#L553-5 main_#t~short9 := main_#t~mem8 > 0; 8608#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 8603#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 8604#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 8599#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 8600#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 8490#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 8491#L554-5 havoc main_#t~mem12; 8738#L554-7 [2018-11-10 06:55:51,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2017532430, now seen corresponding path program 4 times [2018-11-10 06:55:51,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:51,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:51,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:51,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash 479746064, now seen corresponding path program 3 times [2018-11-10 06:55:51,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:51,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:51,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:51,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:55:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1267487551, now seen corresponding path program 5 times [2018-11-10 06:55:51,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:55:51,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:55:51,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:51,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:55:51,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:55:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:55:52,168 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2018-11-10 06:55:59,162 WARN L179 SmtUtils]: Spent 6.96 s on a formula simplification. DAG size of input: 278 DAG size of output: 225 [2018-11-10 06:56:00,274 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 134 [2018-11-10 06:56:00,278 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:56:00,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:56:00,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:56:00,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:56:00,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:56:00,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:56:00,278 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:56:00,278 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:56:00,278 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-10 06:56:00,278 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:56:00,279 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:56:00,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-11-10 06:56:00,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:00,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,643 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2018-11-10 06:56:01,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:01,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:02,118 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:56:02,118 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:56:02,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,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-11-10 06:56:02,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:02,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:02,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:02,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,132 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:02,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,132 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:02,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,137 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:02,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,137 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:02,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,141 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:02,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,141 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:02,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:02,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:02,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:02,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:02,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:02,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:02,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:02,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:02,184 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:56:02,190 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:56:02,190 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 06:56:02,190 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:56:02,191 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:56:02,191 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:56:02,191 INFO L519 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)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5 Supporting invariants [] [2018-11-10 06:56:02,335 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:56:02,338 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:56:02,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:02,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:02,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:02,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:02,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:02,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:02,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:02,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:56:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:02,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:02,447 INFO L477 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 21 treesize of output 22 [2018-11-10 06:56:02,449 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:02,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:56:02,476 INFO L477 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 28 treesize of output 29 [2018-11-10 06:56:02,477 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:02,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:56:02,501 INFO L477 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 34 treesize of output 31 [2018-11-10 06:56:02,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:02,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:56:02,576 INFO L477 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 35 treesize of output 36 [2018-11-10 06:56:02,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:56:02,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:02,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:56:02,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:56:02,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-11-10 06:56:02,604 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:56:02,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 320 states and 333 transitions. cyclomatic complexity: 20 Second operand 12 states. [2018-11-10 06:56:02,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 320 states and 333 transitions. cyclomatic complexity: 20. Second operand 12 states. Result 553 states and 571 transitions. Complement of second has 24 states. [2018-11-10 06:56:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:56:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-10 06:56:02,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 69 letters. Loop has 25 letters. [2018-11-10 06:56:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 94 letters. Loop has 25 letters. [2018-11-10 06:56:02,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:02,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 69 letters. Loop has 50 letters. [2018-11-10 06:56:02,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:02,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 571 transitions. [2018-11-10 06:56:02,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2018-11-10 06:56:02,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 413 states and 427 transitions. [2018-11-10 06:56:02,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2018-11-10 06:56:02,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2018-11-10 06:56:02,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 427 transitions. [2018-11-10 06:56:02,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:56:02,859 INFO L705 BuchiCegarLoop]: Abstraction has 413 states and 427 transitions. [2018-11-10 06:56:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 427 transitions. [2018-11-10 06:56:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 323. [2018-11-10 06:56:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-10 06:56:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 335 transitions. [2018-11-10 06:56:02,864 INFO L728 BuchiCegarLoop]: Abstraction has 323 states and 335 transitions. [2018-11-10 06:56:02,864 INFO L608 BuchiCegarLoop]: Abstraction has 323 states and 335 transitions. [2018-11-10 06:56:02,864 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 06:56:02,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 335 transitions. [2018-11-10 06:56:02,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2018-11-10 06:56:02,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:56:02,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:56:02,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:02,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:02,867 INFO L793 eck$LassoCheckResult]: Stem: 9827#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9776#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 9777#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 9838#L551-1 havoc main_#t~nondet5; 9789#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 9790#L552-1 havoc main_#t~nondet6; 9796#L556-12 assume true; 9865#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 9930#L553-2 main_#t~short9 := main_#t~mem7 > 0; 9929#L553-3 assume main_#t~short9; 9927#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 9925#L553-5 main_#t~short9 := main_#t~mem8 > 0; 9923#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 9921#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 9919#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 9904#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 9761#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 9762#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 9774#L555-2 havoc main_#t~mem13; 9749#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 9750#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 9753#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 9760#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 9767#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 9773#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 9825#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 9830#L557-6 havoc main_#t~mem22; 9835#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 9841#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 9808#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 9809#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 9769#L556-12 assume true; 9770#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 9832#L553-2 main_#t~short9 := main_#t~mem7 > 0; 9837#L553-3 assume main_#t~short9; 9843#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 9812#L553-5 main_#t~short9 := main_#t~mem8 > 0; 9813#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 9817#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 9784#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 9785#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 9788#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 9795#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 9801#L554-5 havoc main_#t~mem12; 10042#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 9820#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 9821#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 9823#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 9780#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 9781#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 9787#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 9792#L556-6 havoc main_#t~mem17; 9798#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 9970#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 9946#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 9944#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 9942#L556-12 assume true; 9940#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 9938#L553-2 main_#t~short9 := main_#t~mem7 > 0; 9936#L553-3 assume main_#t~short9; 9934#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 9932#L553-5 main_#t~short9 := main_#t~mem8 > 0; 9918#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 9917#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 9914#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 9909#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 9907#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 9903#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 9900#L555-2 havoc main_#t~mem13; 9902#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 9846#L557 [2018-11-10 06:56:02,867 INFO L795 eck$LassoCheckResult]: Loop: 9846#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 9847#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 9765#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 9766#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 9896#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 9828#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 9829#L557-6 havoc main_#t~mem22; 9839#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 9840#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 9806#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 9807#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 9892#L556-12 assume true; 9890#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 9888#L553-2 main_#t~short9 := main_#t~mem7 > 0; 9886#L553-3 assume main_#t~short9; 9884#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 9882#L553-5 main_#t~short9 := main_#t~mem8 > 0; 9880#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 9877#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 9875#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 9873#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 9871#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 9869#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 9866#L554-5 havoc main_#t~mem12; 9867#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 9846#L557 [2018-11-10 06:56:02,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1756198726, now seen corresponding path program 6 times [2018-11-10 06:56:02,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:02,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:02,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:02,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:02,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:02,904 INFO L82 PathProgramCache]: Analyzing trace with hash -680477250, now seen corresponding path program 4 times [2018-11-10 06:56:02,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:02,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:02,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:02,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:02,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:02,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash 546999833, now seen corresponding path program 7 times [2018-11-10 06:56:02,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:02,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:02,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:03,179 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2018-11-10 06:56:10,312 WARN L179 SmtUtils]: Spent 7.09 s on a formula simplification. DAG size of input: 281 DAG size of output: 231 [2018-11-10 06:56:11,340 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 06:56:11,344 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:56:11,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:56:11,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:56:11,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:56:11,344 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:56:11,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:56:11,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:56:11,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:56:11,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration11_Lasso [2018-11-10 06:56:11,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:56:11,344 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:56:11,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:11,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:12,482 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 06:56:12,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-11-10 06:56:12,929 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:56:12,930 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:56:12,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:12,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:12,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:12,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,973 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:12,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,974 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:12,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,988 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:12,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,988 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:12,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:12,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:12,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:12,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:12,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:12,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:12,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:12,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:12,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:13,021 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:56:13,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:56:13,026 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:56:13,027 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:56:13,027 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:56:13,027 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:56:13,028 INFO L519 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)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_6 Supporting invariants [] [2018-11-10 06:56:13,126 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:56:13,129 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:56:13,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:13,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:13,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:13,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:13,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:13,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:13,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:13,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:56:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:13,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:13,225 INFO L477 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 21 treesize of output 22 [2018-11-10 06:56:13,226 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:13,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:56:13,253 INFO L477 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 28 treesize of output 29 [2018-11-10 06:56:13,254 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:13,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:56:13,279 INFO L477 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 34 treesize of output 31 [2018-11-10 06:56:13,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:13,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:56:13,353 INFO L477 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 35 treesize of output 36 [2018-11-10 06:56:13,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:56:13,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:56:13,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:56:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:13,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:56:13,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 323 states and 335 transitions. cyclomatic complexity: 19 Second operand 12 states. [2018-11-10 06:56:13,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 323 states and 335 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 470 states and 488 transitions. Complement of second has 24 states. [2018-11-10 06:56:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:56:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2018-11-10 06:56:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 72 transitions. Stem has 70 letters. Loop has 25 letters. [2018-11-10 06:56:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:13,592 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:56:13,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:13,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:13,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:13,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:13,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:13,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:13,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:13,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:56:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:13,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:13,695 INFO L477 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 21 treesize of output 22 [2018-11-10 06:56:13,697 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:13,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:56:13,734 INFO L477 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 28 treesize of output 29 [2018-11-10 06:56:13,737 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:13,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:56:13,762 INFO L477 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 34 treesize of output 31 [2018-11-10 06:56:13,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:13,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:56:13,838 INFO L477 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 35 treesize of output 36 [2018-11-10 06:56:13,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:56:13,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:13,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:56:13,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:56:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:13,867 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:56:13,867 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 323 states and 335 transitions. cyclomatic complexity: 19 Second operand 12 states. [2018-11-10 06:56:14,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 323 states and 335 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 466 states and 482 transitions. Complement of second has 28 states. [2018-11-10 06:56:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:56:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2018-11-10 06:56:14,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 71 transitions. Stem has 70 letters. Loop has 25 letters. [2018-11-10 06:56:14,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:14,150 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:56:14,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:14,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:14,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:14,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:14,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:14,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:14,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:14,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:56:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:14,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:14,235 INFO L477 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 21 treesize of output 22 [2018-11-10 06:56:14,237 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:14,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:56:14,266 INFO L477 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 28 treesize of output 29 [2018-11-10 06:56:14,268 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:14,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:56:14,295 INFO L477 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 34 treesize of output 31 [2018-11-10 06:56:14,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:14,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:56:14,392 INFO L477 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 35 treesize of output 36 [2018-11-10 06:56:14,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:56:14,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:14,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:56:14,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:56:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:14,427 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 9 loop predicates [2018-11-10 06:56:14,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 323 states and 335 transitions. cyclomatic complexity: 19 Second operand 12 states. [2018-11-10 06:56:14,734 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 323 states and 335 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 531 states and 553 transitions. Complement of second has 25 states. [2018-11-10 06:56:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:56:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-10 06:56:14,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 70 letters. Loop has 25 letters. [2018-11-10 06:56:14,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:14,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 95 letters. Loop has 25 letters. [2018-11-10 06:56:14,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:14,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 70 letters. Loop has 50 letters. [2018-11-10 06:56:14,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:14,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 531 states and 553 transitions. [2018-11-10 06:56:14,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 06:56:14,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 531 states to 341 states and 354 transitions. [2018-11-10 06:56:14,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-10 06:56:14,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2018-11-10 06:56:14,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 354 transitions. [2018-11-10 06:56:14,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:56:14,744 INFO L705 BuchiCegarLoop]: Abstraction has 341 states and 354 transitions. [2018-11-10 06:56:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 354 transitions. [2018-11-10 06:56:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 274. [2018-11-10 06:56:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 06:56:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 285 transitions. [2018-11-10 06:56:14,748 INFO L728 BuchiCegarLoop]: Abstraction has 274 states and 285 transitions. [2018-11-10 06:56:14,748 INFO L608 BuchiCegarLoop]: Abstraction has 274 states and 285 transitions. [2018-11-10 06:56:14,748 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 06:56:14,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 285 transitions. [2018-11-10 06:56:14,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2018-11-10 06:56:14,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:56:14,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:56:14,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:14,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:14,751 INFO L793 eck$LassoCheckResult]: Stem: 12735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12688#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 12689#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 12743#L551-1 havoc main_#t~nondet5; 12702#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 12703#L552-1 havoc main_#t~nondet6; 12680#L556-12 assume true; 12682#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 12762#L553-2 main_#t~short9 := main_#t~mem7 > 0; 12763#L553-3 assume main_#t~short9; 12758#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 12759#L553-5 main_#t~short9 := main_#t~mem8 > 0; 12754#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 12755#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 12750#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 12751#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 12674#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 12675#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 12685#L555-2 havoc main_#t~mem13; 12662#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 12663#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 12669#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 12673#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 12679#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 12687#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 12734#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 12736#L557-6 havoc main_#t~mem22; 12740#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 12744#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 12717#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 12718#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 12683#L556-12 assume true; 12684#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 12739#L553-2 main_#t~short9 := main_#t~mem7 > 0; 12742#L553-3 assume main_#t~short9; 12747#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 12721#L553-5 main_#t~short9 := main_#t~mem8 > 0; 12722#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 12724#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 12696#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 12697#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 12701#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 12706#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 12711#L554-5 havoc main_#t~mem12; 12716#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 12727#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 12728#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 12730#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 12692#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 12693#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 12699#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 12708#L556-6 havoc main_#t~mem17; 12713#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 12660#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 12661#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 12667#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 12672#L556-12 assume true; 12903#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 12901#L553-2 main_#t~short9 := main_#t~mem7 > 0; 12900#L553-3 assume main_#t~short9; 12863#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 12807#L553-5 main_#t~short9 := main_#t~mem8 > 0; 12806#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 12805#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 12803#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 12801#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 12798#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 12796#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 12793#L555-2 havoc main_#t~mem13; 12765#L554-7 [2018-11-10 06:56:14,751 INFO L795 eck$LassoCheckResult]: Loop: 12765#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 12725#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 12726#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 12729#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 12690#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 12691#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 12698#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 12707#L556-6 havoc main_#t~mem17; 12712#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 12658#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 12659#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 12670#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 12671#L556-12 assume true; 12778#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 12777#L553-2 main_#t~short9 := main_#t~mem7 > 0; 12745#L553-3 assume main_#t~short9; 12746#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 12719#L553-5 main_#t~short9 := main_#t~mem8 > 0; 12720#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 12723#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 12773#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 12772#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 12771#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 12770#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 12769#L555-2 havoc main_#t~mem13; 12767#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 12768#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 12895#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 12893#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 12891#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 12889#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 12887#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 12885#L557-6 havoc main_#t~mem22; 12883#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 12881#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 12879#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 12877#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 12875#L556-12 assume true; 12873#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 12871#L553-2 main_#t~short9 := main_#t~mem7 > 0; 12869#L553-3 assume main_#t~short9; 12867#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 12865#L553-5 main_#t~short9 := main_#t~mem8 > 0; 12862#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 12804#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 12802#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 12800#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 12797#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 12795#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 12791#L554-5 havoc main_#t~mem12; 12765#L554-7 [2018-11-10 06:56:14,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 56651570, now seen corresponding path program 8 times [2018-11-10 06:56:14,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:14,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:14,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:56:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:14,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 977751009, now seen corresponding path program 2 times [2018-11-10 06:56:14,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:14,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:14,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:14,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:14,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:14,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash -449925934, now seen corresponding path program 9 times [2018-11-10 06:56:14,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:14,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:14,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:14,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:16,182 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 178 DAG size of output: 156 [2018-11-10 06:56:16,298 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-10 06:56:21,540 WARN L179 SmtUtils]: Spent 5.24 s on a formula simplification. DAG size of input: 279 DAG size of output: 226 [2018-11-10 06:56:22,726 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 134 [2018-11-10 06:56:22,730 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:56:22,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:56:22,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:56:22,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:56:22,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:56:22,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:56:22,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:56:22,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:56:22,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration12_Lasso [2018-11-10 06:56:22,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:56:22,731 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:56:22,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:22,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,549 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 06:56:24,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,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-11-10 06:56:24,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-11-10 06:56:24,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:24,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:25,092 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:56:25,092 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:56:25,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-11-10 06:56:25,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:25,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:25,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:25,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,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-11-10 06:56:25,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,108 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:25,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,108 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:25,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,111 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:25,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,112 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:25,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,131 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:25,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,132 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:25,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:25,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:25,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:25,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:25,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:25,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:25,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:25,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:25,153 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:56:25,160 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:56:25,160 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 06:56:25,161 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:56:25,161 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:56:25,162 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:56:25,162 INFO L519 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)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_7 Supporting invariants [] [2018-11-10 06:56:25,348 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:56:25,350 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:56:25,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:25,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:25,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:25,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:25,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:25,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:25,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:25,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 06:56:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:25,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:25,456 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 06:56:25,458 INFO L477 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 22 treesize of output 21 [2018-11-10 06:56:25,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 2 case distinctions, treesize of input 19 treesize of output 27 [2018-11-10 06:56:25,482 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-11-10 06:56:25,537 INFO L477 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 31 treesize of output 28 [2018-11-10 06:56:25,539 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:25,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,574 INFO L477 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 32 treesize of output 29 [2018-11-10 06:56:25,576 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:25,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:50 [2018-11-10 06:56:25,623 INFO L477 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 38 treesize of output 31 [2018-11-10 06:56:25,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:25,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,650 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-10 06:56:25,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 19 [2018-11-10 06:56:25,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:76, output treesize:26 [2018-11-10 06:56:25,765 INFO L477 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 33 treesize of output 30 [2018-11-10 06:56:25,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:56:25,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,786 INFO L477 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 36 treesize of output 33 [2018-11-10 06:56:25,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:56:25,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-11-10 06:56:25,831 INFO L477 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 39 [2018-11-10 06:56:25,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 06:56:25,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,856 INFO L477 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 45 treesize of output 36 [2018-11-10 06:56:25,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 06:56:25,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:88, output treesize:40 [2018-11-10 06:56:25,930 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2018-11-10 06:56:25,932 INFO L477 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 39 treesize of output 38 [2018-11-10 06:56:25,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:25,955 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:25,959 INFO L477 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 2 case distinctions, treesize of input 32 treesize of output 42 [2018-11-10 06:56:25,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:25,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:25,997 INFO L477 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 35 treesize of output 38 [2018-11-10 06:56:25,999 INFO L477 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 28 treesize of output 22 [2018-11-10 06:56:26,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:26,016 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:53 [2018-11-10 06:56:26,113 INFO L477 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 4 case distinctions, treesize of input 61 treesize of output 65 [2018-11-10 06:56:26,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-10 06:56:26,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:26,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:26,153 INFO L477 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 51 treesize of output 56 [2018-11-10 06:56:26,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:26,212 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-10 06:56:26,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 16 [2018-11-10 06:56:26,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:56:26,251 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:107, output treesize:112 [2018-11-10 06:56:26,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:26,591 INFO L477 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 4 case distinctions, treesize of input 66 treesize of output 78 [2018-11-10 06:56:26,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:26,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:26,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 81 [2018-11-10 06:56:26,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:26,634 INFO L477 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 65 treesize of output 66 [2018-11-10 06:56:26,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:26,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:26,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-10 06:56:26,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:70, output treesize:99 [2018-11-10 06:56:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:26,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 24 loop predicates [2018-11-10 06:56:26,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 285 transitions. cyclomatic complexity: 16 Second operand 27 states. [2018-11-10 06:56:28,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 285 transitions. cyclomatic complexity: 16. Second operand 27 states. Result 617 states and 639 transitions. Complement of second has 56 states. [2018-11-10 06:56:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 29 states 2 stem states 26 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 06:56:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 113 transitions. [2018-11-10 06:56:28,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 113 transitions. Stem has 69 letters. Loop has 50 letters. [2018-11-10 06:56:28,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:28,082 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:56:28,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:28,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:28,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:28,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:28,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 06:56:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:28,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:28,172 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 06:56:28,174 INFO L477 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 22 treesize of output 21 [2018-11-10 06:56:28,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 2 case distinctions, treesize of input 19 treesize of output 27 [2018-11-10 06:56:28,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-11-10 06:56:28,243 INFO L477 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 32 treesize of output 29 [2018-11-10 06:56:28,245 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:28,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,266 INFO L477 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 31 treesize of output 28 [2018-11-10 06:56:28,267 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:28,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:50 [2018-11-10 06:56:28,306 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-10 06:56:28,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 19 [2018-11-10 06:56:28,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,330 INFO L477 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 38 treesize of output 31 [2018-11-10 06:56:28,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:28,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:76, output treesize:26 [2018-11-10 06:56:28,444 INFO L477 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 36 treesize of output 33 [2018-11-10 06:56:28,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:56:28,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,469 INFO L477 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 33 treesize of output 30 [2018-11-10 06:56:28,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:56:28,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-11-10 06:56:28,529 INFO L477 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 39 [2018-11-10 06:56:28,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 06:56:28,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,560 INFO L477 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 45 treesize of output 36 [2018-11-10 06:56:28,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 06:56:28,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:88, output treesize:40 [2018-11-10 06:56:28,657 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2018-11-10 06:56:28,660 INFO L477 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 39 treesize of output 38 [2018-11-10 06:56:28,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,695 INFO L477 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 2 case distinctions, treesize of input 32 treesize of output 42 [2018-11-10 06:56:28,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,739 INFO L477 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 35 treesize of output 38 [2018-11-10 06:56:28,741 INFO L477 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 28 treesize of output 22 [2018-11-10 06:56:28,742 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:28,761 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:53 [2018-11-10 06:56:28,859 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-10 06:56:28,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 16 [2018-11-10 06:56:28,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,907 INFO L477 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 4 case distinctions, treesize of input 61 treesize of output 65 [2018-11-10 06:56:28,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:28,913 INFO L477 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 51 treesize of output 56 [2018-11-10 06:56:28,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-10 06:56:28,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:28,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:29,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:56:29,012 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:107, output treesize:112 [2018-11-10 06:56:29,356 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:29,365 INFO L477 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 4 case distinctions, treesize of input 66 treesize of output 78 [2018-11-10 06:56:29,368 INFO L477 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 75 treesize of output 70 [2018-11-10 06:56:29,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:29,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:29,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:29,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:29,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 77 [2018-11-10 06:56:29,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:29,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:29,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-10 06:56:29,436 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:70, output treesize:99 [2018-11-10 06:56:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:29,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 24 loop predicates [2018-11-10 06:56:29,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 285 transitions. cyclomatic complexity: 16 Second operand 27 states. [2018-11-10 06:56:30,857 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 285 transitions. cyclomatic complexity: 16. Second operand 27 states. Result 615 states and 637 transitions. Complement of second has 58 states. [2018-11-10 06:56:30,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 2 stem states 27 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 06:56:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 111 transitions. [2018-11-10 06:56:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 111 transitions. Stem has 69 letters. Loop has 50 letters. [2018-11-10 06:56:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:30,858 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:56:30,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:30,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:30,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:30,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:30,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:30,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:30,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:30,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:30,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:30,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:30,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 06:56:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:30,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:30,974 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 06:56:30,977 INFO L477 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 22 treesize of output 21 [2018-11-10 06:56:30,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 2 case distinctions, treesize of input 19 treesize of output 27 [2018-11-10 06:56:31,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-11-10 06:56:31,055 INFO L477 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 31 treesize of output 28 [2018-11-10 06:56:31,057 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:31,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,079 INFO L477 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 32 treesize of output 29 [2018-11-10 06:56:31,081 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:31,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:50 [2018-11-10 06:56:31,119 INFO L477 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 38 treesize of output 31 [2018-11-10 06:56:31,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:31,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,142 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-10 06:56:31,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 19 [2018-11-10 06:56:31,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:76, output treesize:26 [2018-11-10 06:56:31,256 INFO L477 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 33 treesize of output 30 [2018-11-10 06:56:31,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:56:31,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,278 INFO L477 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 36 treesize of output 33 [2018-11-10 06:56:31,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:56:31,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-11-10 06:56:31,323 INFO L477 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 45 treesize of output 36 [2018-11-10 06:56:31,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 06:56:31,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,351 INFO L477 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 39 [2018-11-10 06:56:31,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 06:56:31,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:88, output treesize:40 [2018-11-10 06:56:31,424 INFO L477 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 46 [2018-11-10 06:56:31,428 INFO L477 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 39 treesize of output 38 [2018-11-10 06:56:31,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:31,455 INFO L477 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 2 case distinctions, treesize of input 32 treesize of output 42 [2018-11-10 06:56:31,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:31,493 INFO L477 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 35 treesize of output 38 [2018-11-10 06:56:31,495 INFO L477 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 28 treesize of output 22 [2018-11-10 06:56:31,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,511 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:53 [2018-11-10 06:56:31,608 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-10 06:56:31,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 16 [2018-11-10 06:56:31,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,658 INFO L477 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 4 case distinctions, treesize of input 61 treesize of output 65 [2018-11-10 06:56:31,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-10 06:56:31,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:31,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:31,704 INFO L477 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 51 treesize of output 56 [2018-11-10 06:56:31,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:31,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:31,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:56:31,763 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:107, output treesize:112 [2018-11-10 06:56:32,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:32,132 INFO L477 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 4 case distinctions, treesize of input 66 treesize of output 78 [2018-11-10 06:56:32,136 INFO L477 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 75 treesize of output 70 [2018-11-10 06:56:32,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:32,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:32,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:32,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:32,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 77 [2018-11-10 06:56:32,175 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:32,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:56:32,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-10 06:56:32,216 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:70, output treesize:99 [2018-11-10 06:56:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:32,273 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 24 loop predicates [2018-11-10 06:56:32,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 285 transitions. cyclomatic complexity: 16 Second operand 27 states. [2018-11-10 06:56:33,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 285 transitions. cyclomatic complexity: 16. Second operand 27 states. Result 659 states and 686 transitions. Complement of second has 63 states. [2018-11-10 06:56:33,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 29 states 2 stem states 26 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 06:56:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 114 transitions. [2018-11-10 06:56:33,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 114 transitions. Stem has 69 letters. Loop has 50 letters. [2018-11-10 06:56:33,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:33,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 114 transitions. Stem has 119 letters. Loop has 50 letters. [2018-11-10 06:56:33,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:33,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 114 transitions. Stem has 69 letters. Loop has 100 letters. [2018-11-10 06:56:33,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:33,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 686 transitions. [2018-11-10 06:56:33,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 141 [2018-11-10 06:56:33,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 471 states and 490 transitions. [2018-11-10 06:56:33,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-10 06:56:33,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2018-11-10 06:56:33,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 490 transitions. [2018-11-10 06:56:33,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:56:33,489 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 490 transitions. [2018-11-10 06:56:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 490 transitions. [2018-11-10 06:56:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 397. [2018-11-10 06:56:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-11-10 06:56:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 416 transitions. [2018-11-10 06:56:33,495 INFO L728 BuchiCegarLoop]: Abstraction has 397 states and 416 transitions. [2018-11-10 06:56:33,496 INFO L608 BuchiCegarLoop]: Abstraction has 397 states and 416 transitions. [2018-11-10 06:56:33,496 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 06:56:33,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 397 states and 416 transitions. [2018-11-10 06:56:33,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 126 [2018-11-10 06:56:33,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:56:33,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:56:33,500 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:33,500 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:33,500 INFO L793 eck$LassoCheckResult]: Stem: 16460#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16399#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 16400#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 16466#L551-1 havoc main_#t~nondet5; 16409#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 16410#L552-1 havoc main_#t~nondet6; 16416#L556-12 assume true; 16500#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 16498#L553-2 main_#t~short9 := main_#t~mem7 > 0; 16496#L553-3 assume main_#t~short9; 16494#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 16492#L553-5 main_#t~short9 := main_#t~mem8 > 0; 16490#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 16488#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 16486#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 16483#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 16484#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 16531#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 16758#L555-2 havoc main_#t~mem13; 16757#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 16756#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 16755#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 16751#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 16750#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 16749#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 16748#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 16747#L556-6 havoc main_#t~mem17; 16746#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 16745#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 16744#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 16743#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 16742#L556-12 assume true; 16741#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 16740#L553-2 main_#t~short9 := main_#t~mem7 > 0; 16739#L553-3 assume main_#t~short9; 16738#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 16737#L553-5 main_#t~short9 := main_#t~mem8 > 0; 16736#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 16734#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 16401#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 16402#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 16412#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 16762#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 16725#L555-2 havoc main_#t~mem13; 16721#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 16720#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 16383#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 16384#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 16397#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 16398#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 16464#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 16465#L557-6 havoc main_#t~mem22; 16475#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 16476#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 16442#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 16443#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 16392#L556-12 assume true; 16393#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 16468#L553-2 main_#t~short9 := main_#t~mem7 > 0; 16469#L553-3 assume main_#t~short9; 16477#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 16478#L553-5 main_#t~short9 := main_#t~mem8 > 0; 16447#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 16448#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 16523#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 16524#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 16419#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 16420#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 16433#L554-5 havoc main_#t~mem12; 16370#L554-7 [2018-11-10 06:56:33,500 INFO L795 eck$LassoCheckResult]: Loop: 16370#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 16371#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 16449#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 16452#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 16405#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 16406#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 16413#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 16421#L556-6 havoc main_#t~mem17; 16428#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 16366#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 16367#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 16374#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 16380#L556-12 assume true; 16391#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 16461#L553-2 main_#t~short9 := main_#t~mem7 > 0; 16467#L553-3 assume main_#t~short9; 16472#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 16438#L553-5 main_#t~short9 := main_#t~mem8 > 0; 16439#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 16446#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 16454#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 16411#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 16385#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 16386#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 16394#L555-2 havoc main_#t~mem13; 16370#L554-7 [2018-11-10 06:56:33,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 397011250, now seen corresponding path program 10 times [2018-11-10 06:56:33,501 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:33,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:33,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:33,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1756935408, now seen corresponding path program 2 times [2018-11-10 06:56:33,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:33,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:33,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:33,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1727949567, now seen corresponding path program 11 times [2018-11-10 06:56:33,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:33,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:33,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:33,824 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-10 06:56:40,516 WARN L179 SmtUtils]: Spent 6.63 s on a formula simplification. DAG size of input: 279 DAG size of output: 232 [2018-11-10 06:56:41,292 WARN L179 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 06:56:41,295 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:56:41,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:56:41,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:56:41,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:56:41,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:56:41,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:56:41,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:56:41,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:56:41,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration13_Lasso [2018-11-10 06:56:41,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:56:41,296 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:56:41,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:41,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:56:43,120 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2018-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,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-11-10 06:56:43,567 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:56:43,567 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:56:43,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,587 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:56:43,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:56:43,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:56:43,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:56:43,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:56:43,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,610 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:43,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:43,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:56:43,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,629 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:56:43,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,629 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:56:43,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:56:43,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-11-10 06:56:43,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:56:43,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:56:43,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:56:43,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:56:43,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:56:43,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:56:43,649 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:56:43,653 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:56:43,653 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:56:43,653 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:56:43,654 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:56:43,654 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:56:43,654 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 Supporting invariants [] [2018-11-10 06:56:43,805 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:56:43,808 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:56:43,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:43,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:43,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:43,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:56:43,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:43,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:56:43,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:56:43,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:56:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:56:43,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:56:43,894 INFO L477 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 21 treesize of output 22 [2018-11-10 06:56:43,895 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:43,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:56:43,921 INFO L477 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 28 treesize of output 29 [2018-11-10 06:56:43,923 INFO L477 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 10 treesize of output 9 [2018-11-10 06:56:43,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:56:43,951 INFO L477 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 34 treesize of output 31 [2018-11-10 06:56:43,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:56:43,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:43,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:56:44,035 INFO L477 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 35 treesize of output 36 [2018-11-10 06:56:44,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:56:44,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:56:44,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:56:44,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:56:44,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:56:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:56:44,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:56:44,064 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 397 states and 416 transitions. cyclomatic complexity: 26 Second operand 12 states. [2018-11-10 06:56:44,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 397 states and 416 transitions. cyclomatic complexity: 26. Second operand 12 states. Result 874 states and 910 transitions. Complement of second has 22 states. [2018-11-10 06:56:44,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 06:56:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:56:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2018-11-10 06:56:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 69 letters. Loop has 25 letters. [2018-11-10 06:56:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 94 letters. Loop has 25 letters. [2018-11-10 06:56:44,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:44,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 69 letters. Loop has 50 letters. [2018-11-10 06:56:44,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:56:44,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 874 states and 910 transitions. [2018-11-10 06:56:44,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 126 [2018-11-10 06:56:44,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 874 states to 627 states and 654 transitions. [2018-11-10 06:56:44,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2018-11-10 06:56:44,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-10 06:56:44,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 627 states and 654 transitions. [2018-11-10 06:56:44,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:56:44,283 INFO L705 BuchiCegarLoop]: Abstraction has 627 states and 654 transitions. [2018-11-10 06:56:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states and 654 transitions. [2018-11-10 06:56:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 552. [2018-11-10 06:56:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-10 06:56:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 578 transitions. [2018-11-10 06:56:44,297 INFO L728 BuchiCegarLoop]: Abstraction has 552 states and 578 transitions. [2018-11-10 06:56:44,297 INFO L608 BuchiCegarLoop]: Abstraction has 552 states and 578 transitions. [2018-11-10 06:56:44,297 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 06:56:44,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 552 states and 578 transitions. [2018-11-10 06:56:44,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 126 [2018-11-10 06:56:44,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:56:44,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:56:44,300 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:44,300 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:56:44,300 INFO L793 eck$LassoCheckResult]: Stem: 18154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18102#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 18103#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 18161#L551-1 havoc main_#t~nondet5; 18115#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 18116#L552-1 havoc main_#t~nondet6; 18123#L556-12 assume true; 18185#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 18183#L553-2 main_#t~short9 := main_#t~mem7 > 0; 18181#L553-3 assume main_#t~short9; 18179#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 18177#L553-5 main_#t~short9 := main_#t~mem8 > 0; 18175#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 18173#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 18171#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 18167#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 18119#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 18120#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 18129#L554-5 havoc main_#t~mem12; 18130#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 18476#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 18475#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 18474#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 18473#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 18472#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 18471#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 18470#L556-6 havoc main_#t~mem17; 18469#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 18468#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 18467#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 18466#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 18465#L556-12 assume true; 18464#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 18463#L553-2 main_#t~short9 := main_#t~mem7 > 0; 18462#L553-3 assume main_#t~short9; 18461#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 18460#L553-5 main_#t~short9 := main_#t~mem8 > 0; 18459#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 18458#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 18457#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 18456#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 18454#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 18455#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 18152#L555-2 havoc main_#t~mem13; 18153#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 18564#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 18563#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 18562#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 18561#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 18560#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 18559#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 18558#L556-6 havoc main_#t~mem17; 18557#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 18556#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 18555#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 18554#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 18553#L556-12 assume true; 18552#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 18551#L553-2 main_#t~short9 := main_#t~mem7 > 0; 18550#L553-3 assume main_#t~short9; 18549#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 18547#L553-5 main_#t~short9 := main_#t~mem8 > 0; 18545#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 18542#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 18543#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 18482#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 18483#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 18479#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 18478#L555-2 havoc main_#t~mem13; 18477#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 18453#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 18451#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 18450#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 18449#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 18448#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 18447#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 18446#L557-6 havoc main_#t~mem22; 18445#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 18444#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 18443#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 18442#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 18441#L556-12 assume true; 18440#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 18439#L553-2 main_#t~short9 := main_#t~mem7 > 0; 18438#L553-3 assume main_#t~short9; 18437#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 18436#L553-5 main_#t~short9 := main_#t~mem8 > 0; 18435#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 18434#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 18433#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 18432#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 18431#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 18430#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 18427#L554-5 havoc main_#t~mem12; 18151#L554-7 [2018-11-10 06:56:44,300 INFO L795 eck$LassoCheckResult]: Loop: 18151#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 18488#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 18510#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 18509#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 18508#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 18507#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 18506#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 18505#L556-6 havoc main_#t~mem17; 18504#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 18503#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 18502#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 18501#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 18500#L556-12 assume true; 18499#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 18498#L553-2 main_#t~short9 := main_#t~mem7 > 0; 18497#L553-3 assume main_#t~short9; 18496#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 18495#L553-5 main_#t~short9 := main_#t~mem8 > 0; 18494#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 18493#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 18492#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 18491#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 18490#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 18489#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 18150#L555-2 havoc main_#t~mem13; 18151#L554-7 [2018-11-10 06:56:44,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1946646977, now seen corresponding path program 12 times [2018-11-10 06:56:44,301 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:44,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:44,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:44,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:44,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1756935408, now seen corresponding path program 3 times [2018-11-10 06:56:44,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:44,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:44,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash 645113490, now seen corresponding path program 13 times [2018-11-10 06:56:44,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:44,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:56:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:56:44,605 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-10 06:57:09,879 WARN L179 SmtUtils]: Spent 25.23 s on a formula simplification. DAG size of input: 352 DAG size of output: 285 [2018-11-10 06:57:11,940 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 06:57:11,944 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:57:11,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:57:11,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:57:11,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:57:11,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:57:11,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:11,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:57:11,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:57:11,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration14_Lasso [2018-11-10 06:57:11,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:57:11,944 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:57:11,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,702 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-11-10 06:58:47,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:47,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:58:48,145 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:58:48,146 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:58:48,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:58:48,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:58:48,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:58:48,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:58:48,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:58:48,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:58:48,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:58:48,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:58:48,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:58:48,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:58:48,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:58:48,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:58:48,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:58:48,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:58:48,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:58:48,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:58:48,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:58:48,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:58:48,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:58:48,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:58:48,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:58:48,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:58:48,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:58:48,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:58:48,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:58:48,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:58:48,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:58:48,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:58:48,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:58:48,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:58:48,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:58:48,175 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:58:48,182 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:58:48,183 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:58:48,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:58:48,183 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:58:48,183 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:58:48,184 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_9 Supporting invariants [] [2018-11-10 06:58:48,262 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 06:58:48,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:58:48,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:48,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:48,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:48,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:58:48,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:48,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:48,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:58:48,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:58:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:48,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:48,348 INFO L477 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 21 treesize of output 22 [2018-11-10 06:58:48,350 INFO L477 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 10 treesize of output 9 [2018-11-10 06:58:48,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:58:48,373 INFO L477 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 28 treesize of output 29 [2018-11-10 06:58:48,375 INFO L477 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 10 treesize of output 9 [2018-11-10 06:58:48,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:58:48,399 INFO L477 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 34 treesize of output 31 [2018-11-10 06:58:48,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:58:48,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:58:48,491 INFO L477 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 35 treesize of output 36 [2018-11-10 06:58:48,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:58:48,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:58:48,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:58:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:58:48,529 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:58:48,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 552 states and 578 transitions. cyclomatic complexity: 35 Second operand 12 states. [2018-11-10 06:58:48,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 552 states and 578 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 825 states and 857 transitions. Complement of second has 22 states. [2018-11-10 06:58:48,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 06:58:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:58:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2018-11-10 06:58:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 94 letters. Loop has 25 letters. [2018-11-10 06:58:48,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:58:48,762 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:58:48,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:48,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:48,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:48,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:58:48,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:48,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:48,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:58:48,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:58:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:48,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:48,880 INFO L477 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 21 treesize of output 22 [2018-11-10 06:58:48,882 INFO L477 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 10 treesize of output 9 [2018-11-10 06:58:48,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:58:48,918 INFO L477 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 28 treesize of output 29 [2018-11-10 06:58:48,921 INFO L477 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 10 treesize of output 9 [2018-11-10 06:58:48,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:58:48,958 INFO L477 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 34 treesize of output 31 [2018-11-10 06:58:48,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:58:48,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:48,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:58:49,084 INFO L477 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 35 treesize of output 36 [2018-11-10 06:58:49,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:58:49,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:58:49,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:58:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:58:49,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 06:58:49,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 552 states and 578 transitions. cyclomatic complexity: 35 Second operand 12 states. [2018-11-10 06:58:49,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 552 states and 578 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 824 states and 854 transitions. Complement of second has 24 states. [2018-11-10 06:58:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 06:58:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:58:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 82 transitions. [2018-11-10 06:58:49,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 82 transitions. Stem has 94 letters. Loop has 25 letters. [2018-11-10 06:58:49,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:58:49,387 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:58:49,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:49,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:49,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:58:49,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:49,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:58:49,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:58:49,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 06:58:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:58:49,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:58:49,487 INFO L477 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 21 treesize of output 22 [2018-11-10 06:58:49,494 INFO L477 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 10 treesize of output 9 [2018-11-10 06:58:49,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-10 06:58:49,527 INFO L477 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 28 treesize of output 29 [2018-11-10 06:58:49,529 INFO L477 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 10 treesize of output 9 [2018-11-10 06:58:49,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-11-10 06:58:49,561 INFO L477 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 34 treesize of output 31 [2018-11-10 06:58:49,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-11-10 06:58:49,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:18 [2018-11-10 06:58:49,650 INFO L477 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 35 treesize of output 36 [2018-11-10 06:58:49,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 06:58:49,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:58:49,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 06:58:49,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-10 06:58:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:58:49,685 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 9 loop predicates [2018-11-10 06:58:49,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 552 states and 578 transitions. cyclomatic complexity: 35 Second operand 12 states. [2018-11-10 06:58:49,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 552 states and 578 transitions. cyclomatic complexity: 35. Second operand 12 states. Result 1012 states and 1061 transitions. Complement of second has 21 states. [2018-11-10 06:58:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 06:58:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 06:58:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 85 transitions. [2018-11-10 06:58:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 85 transitions. Stem has 94 letters. Loop has 25 letters. [2018-11-10 06:58:49,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:58:49,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 85 transitions. Stem has 119 letters. Loop has 25 letters. [2018-11-10 06:58:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:58:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 85 transitions. Stem has 94 letters. Loop has 50 letters. [2018-11-10 06:58:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:58:49,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1012 states and 1061 transitions. [2018-11-10 06:58:49,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-11-10 06:58:49,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1012 states to 588 states and 612 transitions. [2018-11-10 06:58:49,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 06:58:49,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 06:58:49,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 588 states and 612 transitions. [2018-11-10 06:58:49,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:58:49,917 INFO L705 BuchiCegarLoop]: Abstraction has 588 states and 612 transitions. [2018-11-10 06:58:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states and 612 transitions. [2018-11-10 06:58:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 396. [2018-11-10 06:58:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 06:58:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 413 transitions. [2018-11-10 06:58:49,925 INFO L728 BuchiCegarLoop]: Abstraction has 396 states and 413 transitions. [2018-11-10 06:58:49,925 INFO L608 BuchiCegarLoop]: Abstraction has 396 states and 413 transitions. [2018-11-10 06:58:49,925 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 06:58:49,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 413 transitions. [2018-11-10 06:58:49,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2018-11-10 06:58:49,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:58:49,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:58:49,928 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:49,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:58:49,928 INFO L793 eck$LassoCheckResult]: Stem: 22684#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 22641#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 22642#L551 SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 22691#L551-1 havoc main_#t~nondet5; 22651#L552 SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 22652#L552-1 havoc main_#t~nondet6; 22634#L556-12 assume true; 22636#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22688#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22689#L553-3 assume main_#t~short9; 22707#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22666#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22667#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22674#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22678#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22702#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 22627#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 22629#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 22638#L555-2 havoc main_#t~mem13; 22680#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 22621#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 22622#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 22632#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 22633#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 22640#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 22683#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 22687#L557-6 havoc main_#t~mem22; 22692#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 22700#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 22701#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 22672#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 22673#L556-12 assume true; 22931#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22930#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22929#L553-3 assume main_#t~short9; 22928#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22927#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22926#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22925#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22924#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22923#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 22654#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 22655#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 22659#L554-5 havoc main_#t~mem12; 22903#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 22902#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 22901#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 22900#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 22899#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 22898#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 22897#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 22896#L556-6 havoc main_#t~mem17; 22895#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 22894#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 22893#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 22892#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 22891#L556-12 assume true; 22890#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22889#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22888#L553-3 assume main_#t~short9; 22887#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22886#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22885#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22884#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22883#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22882#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 22881#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 22831#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 22807#L555-2 havoc main_#t~mem13; 22616#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 22617#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 22676#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 22677#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 22646#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 22647#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 22650#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 22656#L556-6 havoc main_#t~mem17; 22660#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 22614#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 22615#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 22623#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 22624#L556-12 assume true; 22637#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22686#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22690#L553-3 assume main_#t~short9; 22991#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22990#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22989#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22988#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22985#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22984#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 22983#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 22933#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 22934#L555-2 havoc main_#t~mem13; 22880#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 22878#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 22876#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 22874#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 22872#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 22870#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 22868#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 22866#L557-6 havoc main_#t~mem22; 22864#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 22862#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 22860#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 22858#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 22856#L556-12 assume true; 22854#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22852#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22850#L553-3 assume main_#t~short9; 22848#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22846#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22844#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22842#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22840#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22838#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 22836#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 22834#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 22832#L554-5 havoc main_#t~mem12; 22805#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 22830#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 22829#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 22828#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 22827#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 22826#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 22825#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 22824#L557-6 havoc main_#t~mem22; 22823#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 22822#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 22821#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 22820#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 22819#L556-12 assume true; 22818#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22817#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22816#L553-3 assume main_#t~short9; 22815#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22814#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22813#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22812#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22811#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22810#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 22809#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 22808#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 22804#L554-5 havoc main_#t~mem12; 22806#L554-7 [2018-11-10 06:58:49,928 INFO L795 eck$LassoCheckResult]: Loop: 22806#L554-7 assume main_#t~nondet14 != 0;havoc main_#t~nondet14; 22879#L556 SUMMARY for call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556 22877#L556-1 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 22875#L556-2 SUMMARY for call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-2 22873#L556-3 havoc main_#t~mem15;havoc main_#t~mem16; 22871#L556-4 SUMMARY for call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-4 22869#L556-5 SUMMARY for call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-5 22867#L556-6 havoc main_#t~mem17; 22865#L556-7 SUMMARY for call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-7 22863#L556-8 SUMMARY for call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-8 22861#L556-9 SUMMARY for call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556-9 22859#L556-10 havoc main_#t~mem19;havoc main_#t~mem18; 22857#L556-12 assume true; 22855#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22853#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22851#L553-3 assume main_#t~short9; 22849#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22847#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22845#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22843#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22841#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22839#L554-2 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11; 22837#L555 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 22835#L555-1 SUMMARY for call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4); srcloc: L555-1 22833#L555-2 havoc main_#t~mem13; 22805#L554-7 assume !(main_#t~nondet14 != 0);havoc main_#t~nondet14; 22830#L557 SUMMARY for call main_#t~mem20 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 22829#L557-1 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-1 22828#L557-2 SUMMARY for call write~int(main_#t~mem20 + main_#t~mem21, main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-2 22827#L557-3 havoc main_#t~mem21;havoc main_#t~mem20; 22826#L557-4 SUMMARY for call main_#t~mem22 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-4 22825#L557-5 SUMMARY for call write~int(main_#t~mem22 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-5 22824#L557-6 havoc main_#t~mem22; 22823#L557-7 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L557-7 22822#L557-8 SUMMARY for call main_#t~mem24 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-8 22821#L557-9 SUMMARY for call write~int(main_#t~mem23 + main_#t~mem24, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-9 22820#L557-10 havoc main_#t~mem24;havoc main_#t~mem23; 22819#L556-12 assume true; 22818#L553-1 SUMMARY for call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L553-1 22817#L553-2 main_#t~short9 := main_#t~mem7 > 0; 22816#L553-3 assume main_#t~short9; 22815#L553-4 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-4 22814#L553-5 main_#t~short9 := main_#t~mem8 > 0; 22813#L553-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem8; 22812#L554 SUMMARY for call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 22811#L554-1 SUMMARY for call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-1 22810#L554-2 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11; 22809#L554-3 SUMMARY for call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L554-3 22808#L554-4 SUMMARY for call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4); srcloc: L554-4 22804#L554-5 havoc main_#t~mem12; 22806#L554-7 [2018-11-10 06:58:49,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1299187807, now seen corresponding path program 14 times [2018-11-10 06:58:49,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:58:49,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:58:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:49,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:58:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:49,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 977751009, now seen corresponding path program 3 times [2018-11-10 06:58:49,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:58:49,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:58:49,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:49,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:49,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:50,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:58:50,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1908031679, now seen corresponding path program 15 times [2018-11-10 06:58:50,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:58:50,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:58:50,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:50,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:58:50,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:58:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:58:51,032 WARN L179 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 156 [2018-11-10 06:58:51,160 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-10 07:01:25,252 WARN L179 SmtUtils]: Spent 2.57 m on a formula simplification. DAG size of input: 497 DAG size of output: 407 [2018-11-10 07:01:36,732 WARN L179 SmtUtils]: Spent 11.44 s on a formula simplification that was a NOOP. DAG size: 209 [2018-11-10 07:01:36,738 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:01:36,738 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:01:36,738 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:01:36,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:01:36,738 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:01:36,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:01:36,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:01:36,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:01:36,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca_true-termination.c.i_Iteration15_Lasso [2018-11-10 07:01:36,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:01:36,738 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:01:36,739 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ArithmeticException: integer overflow at java.lang.Math.toIntExact(Math.java:1011) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis$PreprocessingBenchmark.(LassoAnalysis.java:553) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:255) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 07:01:36,742 INFO L168 Benchmark]: Toolchain (without parser) took 376723.86 ms. Allocated memory was 1.0 GB in the beginning and 11.6 GB in the end (delta: 10.6 GB). Free memory was 952.2 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 8.4 GB. Max. memory is 11.5 GB. [2018-11-10 07:01:36,742 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:01:36,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.40 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:01:36,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -212.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:01:36,743 INFO L168 Benchmark]: Boogie Preprocessor took 15.04 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:01:36,743 INFO L168 Benchmark]: RCFGBuilder took 306.78 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-11-10 07:01:36,743 INFO L168 Benchmark]: BuchiAutomizer took 376060.99 ms. Allocated memory was 1.2 GB in the beginning and 11.6 GB in the end (delta: 10.5 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.4 GB. Max. memory is 11.5 GB. [2018-11-10 07:01:36,745 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.40 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -212.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.04 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 306.78 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 376060.99 ms. Allocated memory was 1.2 GB in the beginning and 11.6 GB in the end (delta: 10.5 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 8.4 GB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ArithmeticException: integer overflow de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ArithmeticException: integer overflow: java.lang.Math.toIntExact(Math.java:1011) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...