./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/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 2618f63f0acd986074ff563fe806d4dc698d3d84 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:48:19,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:48:19,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:48:19,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:48:19,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:48:19,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:48:19,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:48:19,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:48:19,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:48:19,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:48:19,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:48:19,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:48:19,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:48:19,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:48:19,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:48:19,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:48:19,748 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:48:19,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:48:19,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:48:19,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:48:19,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:48:19,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:48:19,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:48:19,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:48:19,755 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:48:19,756 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:48:19,757 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:48:19,757 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:48:19,758 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:48:19,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:48:19,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:48:19,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:48:19,760 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:48:19,760 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:48:19,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:48:19,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:48:19,761 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 13:48:19,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:48:19,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:48:19,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:48:19,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:48:19,773 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:48:19,773 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:48:19,774 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:48:19,777 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:48:19,777 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:48:19,777 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:48:19,778 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:48:19,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:48:19,778 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:48:19,778 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:48:19,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:48:19,778 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:48:19,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:48:19,779 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:48:19,779 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:48:19,779 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:48:19,779 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:48:19,779 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:48:19,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:48:19,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:48:19,780 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:48:19,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:48:19,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:48:19,780 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:48:19,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:48:19,781 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_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/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 -> 2618f63f0acd986074ff563fe806d4dc698d3d84 [2018-11-18 13:48:19,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:48:19,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:48:19,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:48:19,816 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:48:19,817 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:48:19,817 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-11-18 13:48:19,855 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/data/2b84ce63e/cbfb899b201340fc9b385f9c473eb63f/FLAGe7c818c6b [2018-11-18 13:48:20,205 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:48:20,205 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-11-18 13:48:20,212 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/data/2b84ce63e/cbfb899b201340fc9b385f9c473eb63f/FLAGe7c818c6b [2018-11-18 13:48:20,224 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/bin-2019/uautomizer/data/2b84ce63e/cbfb899b201340fc9b385f9c473eb63f [2018-11-18 13:48:20,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:48:20,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:48:20,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:48:20,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:48:20,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:48:20,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a8def2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20, skipping insertion in model container [2018-11-18 13:48:20,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:48:20,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:48:20,459 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:48:20,467 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:48:20,501 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:48:20,574 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:48:20,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20 WrapperNode [2018-11-18 13:48:20,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:48:20,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:48:20,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:48:20,575 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:48:20,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:48:20,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:48:20,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:48:20,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:48:20,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... [2018-11-18 13:48:20,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:48:20,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:48:20,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:48:20,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:48:20,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/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-18 13:48:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:48:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:48:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:48:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:48:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:48:20,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:48:20,923 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:48:20,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:48:20 BoogieIcfgContainer [2018-11-18 13:48:20,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:48:20,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:48:20,925 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:48:20,928 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:48:20,929 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:48:20,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:48:20" (1/3) ... [2018-11-18 13:48:20,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28074d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:48:20, skipping insertion in model container [2018-11-18 13:48:20,931 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:48:20,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:48:20" (2/3) ... [2018-11-18 13:48:20,931 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28074d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:48:20, skipping insertion in model container [2018-11-18 13:48:20,931 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:48:20,931 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:48:20" (3/3) ... [2018-11-18 13:48:20,933 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-11-18 13:48:20,982 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:48:20,983 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:48:20,983 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:48:20,983 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:48:20,983 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:48:20,983 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:48:20,983 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:48:20,984 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:48:20,984 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:48:20,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-18 13:48:21,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:21,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:48:21,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:48:21,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:48:21,022 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:48:21,022 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:48:21,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-18 13:48:21,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:21,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:48:21,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:48:21,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:48:21,024 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:48:21,032 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 4#L560-2true [2018-11-18 13:48:21,032 INFO L796 eck$LassoCheckResult]: Loop: 4#L560-2true assume true; 6#L558-1true call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 8#L558-2true assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 10#L560true assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 4#L560-2true [2018-11-18 13:48:21,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 13:48:21,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:21,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:21,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:21,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:21,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1110374, now seen corresponding path program 1 times [2018-11-18 13:48:21,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:21,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:21,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:21,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash 889537576, now seen corresponding path program 1 times [2018-11-18 13:48:21,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:21,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:21,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:21,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:21,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:21,431 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-18 13:48:22,305 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 141 [2018-11-18 13:48:22,594 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-18 13:48:22,605 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:48:22,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:48:22,606 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:48:22,606 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:48:22,606 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:48:22,606 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:48:22,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:48:22,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:48:22,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 13:48:22,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:48:22,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:48:22,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,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-18 13:48:22,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-18 13:48:22,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-18 13:48:22,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-18 13:48:22,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,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-18 13:48:22,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:22,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:23,521 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 117 [2018-11-18 13:48:23,686 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99 [2018-11-18 13:48:23,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:23,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:23,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:23,856 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-11-18 13:48:24,278 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:48:24,282 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:48:24,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,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-18 13:48:24,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:24,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:24,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:24,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:24,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:24,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:24,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:24,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:24,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:24,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:24,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:24,392 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:48:24,396 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:48:24,396 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:48:24,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:48:24,399 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:48:24,399 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:48:24,400 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 Supporting invariants [] [2018-11-18 13:48:24,929 INFO L297 tatePredicateManager]: 106 out of 109 supporting invariants were superfluous and have been removed [2018-11-18 13:48:24,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:48:24,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:24,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:24,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:25,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,026 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 25 treesize of output 34 [2018-11-18 13:48:25,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,032 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 23 treesize of output 16 [2018-11-18 13:48:25,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,048 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-18 13:48:25,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:26 [2018-11-18 13:48:25,064 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-18 13:48:25,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:48:25,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-18 13:48:25,142 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 24 states and 30 transitions. Complement of second has 8 states. [2018-11-18 13:48:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:48:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:48:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-18 13:48:25,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-18 13:48:25,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:25,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 13:48:25,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:25,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 13:48:25,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:25,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 30 transitions. [2018-11-18 13:48:25,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:25,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 14 states and 17 transitions. [2018-11-18 13:48:25,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 13:48:25,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 13:48:25,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-18 13:48:25,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:48:25,153 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 13:48:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-18 13:48:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 13:48:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 13:48:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 13:48:25,172 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 13:48:25,172 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 13:48:25,172 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:48:25,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 13:48:25,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:25,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:48:25,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:48:25,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 13:48:25,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:48:25,173 INFO L794 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 522#L560-2 assume true; 526#L558-1 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 534#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 533#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 523#L560-2 [2018-11-18 13:48:25,173 INFO L796 eck$LassoCheckResult]: Loop: 523#L560-2 assume true; 524#L558-1 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 529#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 531#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 523#L560-2 [2018-11-18 13:48:25,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash 889537578, now seen corresponding path program 1 times [2018-11-18 13:48:25,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:25,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:25,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:25,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1110374, now seen corresponding path program 2 times [2018-11-18 13:48:25,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:25,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:25,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -350881521, now seen corresponding path program 1 times [2018-11-18 13:48:25,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:25,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:48:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:48:25,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:48:25,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8737e88e-4c88-4b83-a0f9-38dc9d6ecb2f/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-18 13:48:25,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:25,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:25,386 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-11-18 13:48:25,406 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 57 treesize of output 53 [2018-11-18 13:48:25,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-18 13:48:25,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 67 [2018-11-18 13:48:25,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 81 [2018-11-18 13:48:25,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-11-18 13:48:25,533 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,637 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:13 [2018-11-18 13:48:25,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-18 13:48:25,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:25,671 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 23 treesize of output 16 [2018-11-18 13:48:25,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,686 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-18 13:48:25,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:12 [2018-11-18 13:48:25,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-18 13:48:25,738 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 11 treesize of output 7 [2018-11-18 13:48:25,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:25,743 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-18 13:48:25,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-11-18 13:48:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:48:25,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:48:25,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-18 13:48:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:48:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:48:25,867 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-18 13:48:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:48:25,951 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-18 13:48:25,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:48:25,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-18 13:48:25,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:25,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2018-11-18 13:48:25,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 13:48:25,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 13:48:25,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-18 13:48:25,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:48:25,954 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 13:48:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-18 13:48:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-11-18 13:48:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 13:48:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 13:48:25,955 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 13:48:25,955 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 13:48:25,955 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:48:25,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-18 13:48:25,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:25,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:48:25,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:48:25,956 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 13:48:25,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:48:25,956 INFO L794 eck$LassoCheckResult]: Stem: 602#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 596#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 597#L560-2 assume true; 599#L558-1 [2018-11-18 13:48:25,956 INFO L796 eck$LassoCheckResult]: Loop: 599#L558-1 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 603#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 605#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 598#L560-2 assume true; 599#L558-1 [2018-11-18 13:48:25,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 13:48:25,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:25,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:25,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:25,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1174906, now seen corresponding path program 1 times [2018-11-18 13:48:25,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:25,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:25,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1805861148, now seen corresponding path program 2 times [2018-11-18 13:48:25,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:25,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:25,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:25,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:26,560 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 132 [2018-11-18 13:48:26,776 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-18 13:48:26,779 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:48:26,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:48:26,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:48:26,780 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:48:26,780 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:48:26,780 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:48:26,780 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:48:26,780 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:48:26,780 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 13:48:26,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:48:26,780 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:48:26,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-18 13:48:26,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-18 13:48:26,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-18 13:48:26,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-18 13:48:26,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-18 13:48:26,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:26,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-18 13:48:26,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-18 13:48:26,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-18 13:48:26,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-18 13:48:26,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:27,582 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2018-11-18 13:48:27,732 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2018-11-18 13:48:27,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:27,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-18 13:48:27,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-18 13:48:27,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-18 13:48:27,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-18 13:48:27,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-18 13:48:27,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:28,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:48:28,172 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:48:28,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:28,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:28,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:28,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,197 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:28,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,198 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:28,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:28,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:28,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,212 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:28,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,213 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:28,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:28,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:28,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:28,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:28,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:28,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:28,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:28,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:28,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:28,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:28,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:28,244 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:48:28,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:48:28,245 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:48:28,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:48:28,245 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:48:28,246 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:48:28,246 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 1 Supporting invariants [] [2018-11-18 13:48:28,679 INFO L297 tatePredicateManager]: 104 out of 109 supporting invariants were superfluous and have been removed [2018-11-18 13:48:28,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:48:28,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:48:28,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:28,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:28,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-18 13:48:28,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,754 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 59 treesize of output 69 [2018-11-18 13:48:28,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-18 13:48:28,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-11-18 13:48:28,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,829 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-18 13:48:28,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:28,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-18 13:48:28,907 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:28,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:28,939 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:28,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:28,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:28,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,001 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:23 [2018-11-18 13:48:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:29,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:29,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,052 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2018-11-18 13:48:29,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,056 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 58 [2018-11-18 13:48:29,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2018-11-18 13:48:29,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 13:48:29,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:29,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:29,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2018-11-18 13:48:29,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,216 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 65 treesize of output 66 [2018-11-18 13:48:29,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,220 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 49 treesize of output 38 [2018-11-18 13:48:29,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,257 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 0 case distinctions, treesize of input 66 treesize of output 74 [2018-11-18 13:48:29,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:29,260 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 51 treesize of output 40 [2018-11-18 13:48:29,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:29,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:48:29,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:100 [2018-11-18 13:48:29,321 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-18 13:48:29,321 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 13:48:29,321 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-18 13:48:29,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 25 states and 28 transitions. Complement of second has 10 states. [2018-11-18 13:48:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 13:48:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 13:48:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-11-18 13:48:29,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 13:48:29,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:29,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 13:48:29,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:29,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 13:48:29,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:29,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-18 13:48:29,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:29,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 14 states and 15 transitions. [2018-11-18 13:48:29,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 13:48:29,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-18 13:48:29,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2018-11-18 13:48:29,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:48:29,396 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-18 13:48:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2018-11-18 13:48:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-11-18 13:48:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 13:48:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-18 13:48:29,397 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-18 13:48:29,397 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-18 13:48:29,397 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:48:29,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-18 13:48:29,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 13:48:29,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:48:29,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:48:29,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-18 13:48:29,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 13:48:29,398 INFO L794 eck$LassoCheckResult]: Stem: 1131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1126#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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4);havoc main_#t~mem9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4);havoc main_#t~mem10;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4);havoc main_#t~mem11;call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1127#L560-2 assume true; 1128#L558-1 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1133#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1135#L560 assume main_#t~mem15 > 1;havoc main_#t~mem15;call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem17; 1129#L560-2 assume true; 1130#L558-1 [2018-11-18 13:48:29,398 INFO L796 eck$LassoCheckResult]: Loop: 1130#L558-1 call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); 1132#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12;call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4);call write~int(1 + main_#t~mem14, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); 1134#L560 assume !(main_#t~mem15 > 1);havoc main_#t~mem15;call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(1 + main_#t~mem19, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem19; 1136#L560-2 assume true; 1130#L558-1 [2018-11-18 13:48:29,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1805861086, now seen corresponding path program 2 times [2018-11-18 13:48:29,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:29,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:29,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:48:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:29,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1174906, now seen corresponding path program 2 times [2018-11-18 13:48:29,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:29,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:29,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:29,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:48:29,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:29,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1950316503, now seen corresponding path program 2 times [2018-11-18 13:48:29,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:29,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:29,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:48:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:48:30,749 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 203 DAG size of output: 167 [2018-11-18 13:48:31,316 WARN L180 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-18 13:48:31,319 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:48:31,319 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:48:31,319 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:48:31,319 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:48:31,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:48:31,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:48:31,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:48:31,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:48:31,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 13:48:31,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:48:31,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:48:31,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,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-18 13:48:31,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,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-18 13:48:31,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-18 13:48:31,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-18 13:48:31,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,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-18 13:48:31,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-18 13:48:31,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,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-18 13:48:31,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-18 13:48:31,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:31,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-18 13:48:31,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:32,322 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 124 [2018-11-18 13:48:32,482 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-11-18 13:48:32,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:48:32,948 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:48:32,948 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:48:32,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,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-18 13:48:32,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:32,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:32,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,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-18 13:48:32,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,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-18 13:48:32,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:32,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:32,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,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-18 13:48:32,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,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-18 13:48:32,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:32,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:32,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,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-18 13:48:32,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:32,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:32,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:32,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:32,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:32,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:32,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:32,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:32,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:32,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:32,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:32,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:32,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:32,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:32,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:33,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:33,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:33,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:48:33,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:48:33,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:48:33,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,052 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:33,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,055 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:33,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,069 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:33,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,070 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:33,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,092 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:33,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,097 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:33,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:33,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:33,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,115 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 13:48:33,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,116 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 13:48:33,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:48:33,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:48:33,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-18 13:48:33,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:48:33,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:48:33,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:48:33,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:48:33,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:48:33,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:48:33,138 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:48:33,142 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:48:33,142 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:48:33,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:48:33,143 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 13:48:33,144 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:48:33,144 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 + 1 Supporting invariants [] [2018-11-18 13:48:33,714 INFO L297 tatePredicateManager]: 97 out of 102 supporting invariants were superfluous and have been removed [2018-11-18 13:48:33,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:48:33,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 13:48:33,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:33,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:33,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-18 13:48:33,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,792 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,793 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 59 treesize of output 69 [2018-11-18 13:48:33,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-18 13:48:33,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-11-18 13:48:33,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,880 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-18 13:48:33,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:33,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-18 13:48:33,973 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:33,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,084 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:23 [2018-11-18 13:48:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:34,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:34,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,135 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2018-11-18 13:48:34,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,139 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 58 [2018-11-18 13:48:34,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2018-11-18 13:48:34,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 13:48:34,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:34,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:34,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2018-11-18 13:48:34,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,281 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 65 treesize of output 70 [2018-11-18 13:48:34,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,283 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 49 treesize of output 38 [2018-11-18 13:48:34,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,318 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 0 case distinctions, treesize of input 66 treesize of output 74 [2018-11-18 13:48:34,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,321 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 51 treesize of output 40 [2018-11-18 13:48:34,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:48:34,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:100 [2018-11-18 13:48:34,378 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-18 13:48:34,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 13:48:34,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 13:48:34,427 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 17 transitions. Complement of second has 8 states. [2018-11-18 13:48:34,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:48:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 13:48:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-11-18 13:48:34,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 13:48:34,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:34,428 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:48:34,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:34,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:34,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-18 13:48:34,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,480 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 59 treesize of output 69 [2018-11-18 13:48:34,500 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-18 13:48:34,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-11-18 13:48:34,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-18 13:48:34,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,586 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,586 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-18 13:48:34,587 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,606 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,685 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:23 [2018-11-18 13:48:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:34,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:34,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,735 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2018-11-18 13:48:34,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 68 [2018-11-18 13:48:34,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 13:48:34,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,789 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 47 treesize of output 50 [2018-11-18 13:48:34,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:34,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:34,829 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2018-11-18 13:48:34,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,883 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 65 treesize of output 70 [2018-11-18 13:48:34,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,885 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 49 treesize of output 38 [2018-11-18 13:48:34,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,924 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 0 case distinctions, treesize of input 66 treesize of output 74 [2018-11-18 13:48:34,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:34,927 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 51 treesize of output 40 [2018-11-18 13:48:34,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:34,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:48:34,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:100 [2018-11-18 13:48:34,993 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-18 13:48:34,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 13:48:34,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 13:48:35,045 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 17 transitions. Complement of second has 8 states. [2018-11-18 13:48:35,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:48:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 13:48:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-11-18 13:48:35,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 5 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 13:48:35,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:35,046 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 13:48:35,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:35,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:35,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-18 13:48:35,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,093 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,094 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 59 treesize of output 69 [2018-11-18 13:48:35,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,117 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-18 13:48:35,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-11-18 13:48:35,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-18 13:48:35,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-18 13:48:35,218 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,237 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,320 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:23 [2018-11-18 13:48:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:35,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:48:35,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,378 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 74 [2018-11-18 13:48:35,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,382 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 58 [2018-11-18 13:48:35,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2018-11-18 13:48:35,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 13:48:35,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:35,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 13:48:35,463 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:157 [2018-11-18 13:48:35,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,523 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 0 case distinctions, treesize of input 66 treesize of output 74 [2018-11-18 13:48:35,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,526 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 51 treesize of output 40 [2018-11-18 13:48:35,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,564 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 65 treesize of output 70 [2018-11-18 13:48:35,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:48:35,568 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 49 treesize of output 38 [2018-11-18 13:48:35,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:48:35,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:48:35,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:100 [2018-11-18 13:48:35,631 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-18 13:48:35,631 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 13:48:35,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 13:48:35,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 18 states and 20 transitions. Complement of second has 9 states. [2018-11-18 13:48:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 13:48:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 13:48:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-18 13:48:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 13:48:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 13:48:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 13:48:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:48:35,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2018-11-18 13:48:35,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:48:35,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2018-11-18 13:48:35,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:48:35,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:48:35,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:48:35,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:48:35,693 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:48:35,693 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:48:35,693 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:48:35,693 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:48:35,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:48:35,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:48:35,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:48:35,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:48:35 BoogieIcfgContainer [2018-11-18 13:48:35,698 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:48:35,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:48:35,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:48:35,699 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:48:35,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:48:20" (3/4) ... [2018-11-18 13:48:35,701 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:48:35,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:48:35,702 INFO L168 Benchmark]: Toolchain (without parser) took 15475.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 458.2 MB). Free memory was 951.2 MB in the beginning and 908.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 501.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:35,703 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:48:35,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:35,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:35,703 INFO L168 Benchmark]: Boogie Preprocessor took 20.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:35,703 INFO L168 Benchmark]: RCFGBuilder took 295.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:35,704 INFO L168 Benchmark]: BuchiAutomizer took 14773.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.9 MB). Free memory was 1.1 GB in the beginning and 908.2 MB in the end (delta: 216.0 MB). Peak memory consumption was 505.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:35,704 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.5 GB. Free memory is still 908.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:48:35,706 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14773.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.9 MB). Free memory was 1.1 GB in the beginning and 908.2 MB in the end (delta: 216.0 MB). Peak memory consumption was 505.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.5 GB. Free memory is still 908.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 2 * unknown-#memory_int-unknown[x][x] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[y][y] + 1 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 11.6s. Construction of modules took 0.1s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 22 SDslu, 28 SDs, 0 SdLazy, 93 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital2114 mio100 ax101 hnf100 lsp97 ukn26 mio100 lsp38 div100 bol100 ite100 ukn100 eq197 hnf87 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...