./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/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 cb5770b8d32c05b82025135c2b222cf31b0a4100 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:32:19,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:32:19,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:32:19,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:32:19,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:32:19,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:32:19,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:32:19,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:32:19,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:32:19,782 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:32:19,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:32:19,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:32:19,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:32:19,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:32:19,785 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:32:19,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:32:19,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:32:19,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:32:19,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:32:19,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:32:19,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:32:19,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:32:19,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:32:19,794 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:32:19,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:32:19,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:32:19,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:32:19,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:32:19,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:32:19,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:32:19,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:32:19,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:32:19,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:32:19,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:32:19,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:32:19,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:32:19,800 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:32:19,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:32:19,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:32:19,812 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:32:19,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:32:19,812 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:32:19,813 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:32:19,813 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:32:19,813 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:32:19,813 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:32:19,813 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:32:19,813 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:32:19,813 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:32:19,814 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:32:19,815 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:32:19,815 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:32:19,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:32:19,815 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:32:19,815 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:32:19,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:32:19,815 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:32:19,816 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:32:19,816 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:32:19,816 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_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/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 -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2018-11-28 12:32:19,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:32:19,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:32:19,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:32:19,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:32:19,849 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:32:19,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-28 12:32:19,885 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/data/5e58dffc7/746e5bd21f3c4603b0632358fac4fd72/FLAG8d17ea6ab [2018-11-28 12:32:20,219 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:32:20,220 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-28 12:32:20,226 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/data/5e58dffc7/746e5bd21f3c4603b0632358fac4fd72/FLAG8d17ea6ab [2018-11-28 12:32:20,234 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/data/5e58dffc7/746e5bd21f3c4603b0632358fac4fd72 [2018-11-28 12:32:20,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:32:20,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:32:20,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:32:20,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:32:20,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:32:20,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b1a59d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20, skipping insertion in model container [2018-11-28 12:32:20,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:32:20,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:32:20,444 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:32:20,453 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:32:20,523 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:32:20,554 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:32:20,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20 WrapperNode [2018-11-28 12:32:20,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:32:20,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:32:20,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:32:20,556 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:32:20,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:32:20,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:32:20,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:32:20,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:32:20,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... [2018-11-28 12:32:20,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:32:20,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:32:20,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:32:20,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:32:20,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/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-28 12:32:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:32:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:32:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:32:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:32:20,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:32:20,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:32:20,944 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:32:20,945 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-28 12:32:20,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:32:20 BoogieIcfgContainer [2018-11-28 12:32:20,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:32:20,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:32:20,946 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:32:20,950 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:32:20,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:32:20,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:32:20" (1/3) ... [2018-11-28 12:32:20,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@318d939c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:32:20, skipping insertion in model container [2018-11-28 12:32:20,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:32:20,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:32:20" (2/3) ... [2018-11-28 12:32:20,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@318d939c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:32:20, skipping insertion in model container [2018-11-28 12:32:20,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:32:20,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:32:20" (3/3) ... [2018-11-28 12:32:20,954 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i [2018-11-28 12:32:21,001 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:32:21,002 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:32:21,002 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:32:21,002 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:32:21,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:32:21,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:32:21,003 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:32:21,003 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:32:21,003 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:32:21,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 12:32:21,036 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-28 12:32:21,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:21,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:21,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:32:21,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:32:21,042 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:32:21,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 12:32:21,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-28 12:32:21,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:21,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:21,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 12:32:21,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:32:21,050 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2018-11-28 12:32:21,050 INFO L796 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2018-11-28 12:32:21,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,055 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2018-11-28 12:32:21,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2018-11-28 12:32:21,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,208 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2018-11-28 12:32:21,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:21,415 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-28 12:32:21,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:21,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:32:21,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:32:21,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:32:21,487 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-28 12:32:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,614 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-11-28 12:32:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:32:21,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-28 12:32:21,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:21,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2018-11-28 12:32:21,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 12:32:21,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 12:32:21,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-11-28 12:32:21,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:32:21,626 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-28 12:32:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-11-28 12:32:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-11-28 12:32:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:32:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 12:32:21,646 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:32:21,646 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:32:21,647 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:32:21,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 12:32:21,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:21,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:21,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:21,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:32:21,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:32:21,649 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 92#L-1 havoc main_#res;havoc main_#t~nondet21; 85#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 78#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 79#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 94#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 81#L567-2 [2018-11-28 12:32:21,649 INFO L796 eck$LassoCheckResult]: Loop: 81#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 89#L566 assume !f_#t~short13; 90#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 86#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 81#L567-2 [2018-11-28 12:32:21,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2018-11-28 12:32:21,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2018-11-28 12:32:21,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:21,699 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-28 12:32:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:32:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:32:21,699 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:32:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:32:21,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:32:21,700 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 12:32:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:21,716 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-28 12:32:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:32:21,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-28 12:32:21,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:21,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-11-28 12:32:21,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 12:32:21,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 12:32:21,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-28 12:32:21,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:32:21,718 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-28 12:32:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-28 12:32:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 12:32:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:32:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-28 12:32:21,719 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-28 12:32:21,719 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-28 12:32:21,719 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:32:21,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-28 12:32:21,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:21,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:21,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:21,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:32:21,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:32:21,720 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 havoc main_#res;havoc main_#t~nondet21; 131#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 124#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 125#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 140#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 127#L567-2 [2018-11-28 12:32:21,720 INFO L796 eck$LassoCheckResult]: Loop: 127#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 135#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 136#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 132#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 127#L567-2 [2018-11-28 12:32:21,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2018-11-28 12:32:21,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2018-11-28 12:32:21,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:32:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2018-11-28 12:32:21,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:21,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:21,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:21,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:21,925 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-11-28 12:32:22,494 WARN L180 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-11-28 12:32:22,753 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-28 12:32:22,765 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:32:22,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:32:22,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:32:22,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:32:22,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:32:22,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:32:22,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:32:22,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:32:22,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 12:32:22,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:32:22,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:32:22,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,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-28 12:32:22,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-28 12:32:22,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,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-28 12:32:22,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-28 12:32:22,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-28 12:32:22,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,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-28 12:32:22,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-28 12:32:22,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:22,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:23,338 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2018-11-28 12:32:23,449 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2018-11-28 12:32:23,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:23,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:23,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:23,792 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:32:23,797 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:32:23,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:23,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:23,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:23,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,885 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:23,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,887 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:23,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,920 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:23,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:23,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,930 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:23,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,933 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:23,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,953 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:23,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,954 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:23,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,959 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:23,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,965 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:23,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,966 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:23,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:23,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-28 12:32:23,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:23,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:23,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:23,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:23,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:23,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:23,984 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:32:23,995 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:32:23,996 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 12:32:23,997 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:32:23,998 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 12:32:23,999 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:32:23,999 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2018-11-28 12:32:24,232 INFO L297 tatePredicateManager]: 60 out of 64 supporting invariants were superfluous and have been removed [2018-11-28 12:32:24,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:32:24,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:24,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:24,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-28 12:32:24,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-28 12:32:24,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-11-28 12:32:24,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:24,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-28 12:32:24,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-11-28 12:32:24,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:24,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-11-28 12:32:24,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:24,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-28 12:32:24,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:24,627 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-11-28 12:32:24,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:24,658 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-28 12:32:24,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:24,709 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,732 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,742 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,751 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,785 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:24,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:24,817 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-11-28 12:32:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:24,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:24,933 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-28 12:32:24,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:32:24,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-28 12:32:25,377 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 34 states and 40 transitions. Complement of second has 10 states. [2018-11-28 12:32:25,378 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-28 12:32:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:32:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-28 12:32:25,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:32:25,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:32:25,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 12:32:25,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:32:25,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 12:32:25,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:32:25,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 40 transitions. [2018-11-28 12:32:25,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:25,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 39 transitions. [2018-11-28 12:32:25,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 12:32:25,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 12:32:25,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2018-11-28 12:32:25,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:32:25,383 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-28 12:32:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2018-11-28 12:32:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-28 12:32:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:32:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 12:32:25,385 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 12:32:25,385 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 12:32:25,385 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:32:25,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-28 12:32:25,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:25,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:25,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:25,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:32:25,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:32:25,386 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 517#L-1 havoc main_#res;havoc main_#t~nondet21; 506#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 503#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 504#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 505#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 511#L567-5 [2018-11-28 12:32:25,386 INFO L796 eck$LassoCheckResult]: Loop: 511#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 523#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 524#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 519#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 511#L567-5 [2018-11-28 12:32:25,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2018-11-28 12:32:25,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:25,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:25,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2018-11-28 12:32:25,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:25,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2018-11-28 12:32:25,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:25,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:26,058 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 126 [2018-11-28 12:32:26,251 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-28 12:32:26,254 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:32:26,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:32:26,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:32:26,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:32:26,254 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:32:26,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:32:26,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:32:26,254 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:32:26,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 12:32:26,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:32:26,254 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:32:26,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,716 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2018-11-28 12:32:26,824 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-11-28 12:32:26,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:26,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:32:27,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:32:27,203 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:32:27,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,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-28 12:32:27,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:32:27,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:32:27,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:32:27,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,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-28 12:32:27,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,240 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:27,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,241 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:27,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,267 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:32:27,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,268 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:32:27,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:32:27,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:32:27,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:32:27,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:32:27,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:32:27,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:32:27,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:32:27,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:32:27,282 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:32:27,292 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 12:32:27,292 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 12:32:27,292 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:32:27,293 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 12:32:27,293 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:32:27,294 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2018-11-28 12:32:27,474 INFO L297 tatePredicateManager]: 55 out of 59 supporting invariants were superfluous and have been removed [2018-11-28 12:32:27,478 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:32:27,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:27,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:27,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-28 12:32:27,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-28 12:32:27,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-11-28 12:32:27,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:27,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-28 12:32:27,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-11-28 12:32:27,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:27,825 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-11-28 12:32:27,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:27,851 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-28 12:32:27,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:27,871 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-11-28 12:32:27,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:27,908 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-28 12:32:27,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:27,948 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,961 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,967 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,972 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,978 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:27,984 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:28,004 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:312, output treesize:83 [2018-11-28 12:32:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:28,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:28,085 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-28 12:32:28,085 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:32:28,085 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 12:32:28,191 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2018-11-28 12:32:28,192 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-28 12:32:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:32:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:32:28,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 12:32:28,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:32:28,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 12:32:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:32:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 12:32:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:32:28,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-28 12:32:28,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:28,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2018-11-28 12:32:28,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 12:32:28,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 12:32:28,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2018-11-28 12:32:28,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:32:28,196 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-28 12:32:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2018-11-28 12:32:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-28 12:32:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 12:32:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-28 12:32:28,197 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-28 12:32:28,198 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-28 12:32:28,198 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:32:28,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-28 12:32:28,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:28,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:28,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:28,198 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:28,198 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:32:28,199 INFO L794 eck$LassoCheckResult]: Stem: 887#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 886#L-1 havoc main_#res;havoc main_#t~nondet21; 872#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 865#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 866#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 891#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 892#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 878#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 879#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 873#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-11-28 12:32:28,199 INFO L796 eck$LassoCheckResult]: Loop: 867#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 868#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 882#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 897#L566-2 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 896#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 867#L568 [2018-11-28 12:32:28,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2018-11-28 12:32:28,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:28,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2018-11-28 12:32:28,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:28,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:28,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:28,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:28,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2018-11-28 12:32:28,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:28,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:28,423 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-28 12:32:28,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:32:28,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/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-28 12:32:28,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:28,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:28,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-28 12:32:28,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-28 12:32:28,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-11-28 12:32:28,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-28 12:32:28,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-11-28 12:32:28,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:28,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-11-28 12:32:28,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:28,708 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-28 12:32:28,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:28,724 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-11-28 12:32:28,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:28,744 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-28 12:32:28,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:28,768 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,781 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,786 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,792 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,797 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:28,818 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:305, output treesize:76 [2018-11-28 12:32:28,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 149 [2018-11-28 12:32:28,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:28,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-28 12:32:28,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:28,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 107 [2018-11-28 12:32:28,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-28 12:32:28,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:29,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:29,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 61 treesize of output 104 [2018-11-28 12:32:29,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:29,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-28 12:32:29,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:29,030 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:29,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:29,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:29,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:29,069 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:237, output treesize:61 [2018-11-28 12:32:29,099 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-28 12:32:29,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:32:29,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-11-28 12:32:29,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:32:29,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:32:29,263 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-28 12:32:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:29,843 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-28 12:32:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:32:29,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2018-11-28 12:32:29,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:29,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 50 transitions. [2018-11-28 12:32:29,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-28 12:32:29,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 12:32:29,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 50 transitions. [2018-11-28 12:32:29,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:32:29,845 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-28 12:32:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 50 transitions. [2018-11-28 12:32:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-11-28 12:32:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 12:32:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-28 12:32:29,847 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-28 12:32:29,847 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-28 12:32:29,847 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:32:29,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-11-28 12:32:29,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-28 12:32:29,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:32:29,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:32:29,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:32:29,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:32:29,848 INFO L794 eck$LassoCheckResult]: Stem: 1057#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1056#L-1 havoc main_#res;havoc main_#t~nondet21; 1038#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.alloc(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.alloc(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1035#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1036#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1037#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem8;havoc f_#t~mem9; 1065#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1060#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1063#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1051#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1052#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1061#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1064#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1050#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-11-28 12:32:29,848 INFO L796 eck$LassoCheckResult]: Loop: 1042#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1043#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1059#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1062#L566-7 assume !!f_#t~short13;havoc f_#t~mem12;havoc f_#t~mem11;havoc f_#t~short13; 1066#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1042#L568-1 [2018-11-28 12:32:29,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 122778203, now seen corresponding path program 1 times [2018-11-28 12:32:29,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:29,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:32:29,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce6b28ca-5ed7-47d2-927f-27d6f0d65f3f/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:32:29,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:32:29,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:32:30,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-11-28 12:32:30,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-28 12:32:30,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-11-28 12:32:30,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-11-28 12:32:30,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 132 [2018-11-28 12:32:30,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:30,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 79 [2018-11-28 12:32:30,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:30,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-28 12:32:30,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:30,427 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 65 [2018-11-28 12:32:30,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:30,448 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 77 [2018-11-28 12:32:30,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 12:32:30,473 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,485 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,491 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,496 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,508 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:30,525 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:305, output treesize:76 [2018-11-28 12:32:30,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 108 [2018-11-28 12:32:30,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:32:30,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-28 12:32:30,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:32:30,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-11-28 12:32:30,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:99, output treesize:84 [2018-11-28 12:32:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:32:30,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:32:30,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-28 12:32:30,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:32:30,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:32:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2018-11-28 12:32:30,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:32:30,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:32:30,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:30,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:32:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:32:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:32:30,776 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-11-28 12:32:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:32:30,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:32:30,815 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 12:32:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:32:30,870 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-28 12:32:30,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:32:30,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2018-11-28 12:32:30,871 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:32:30,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-28 12:32:30,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:32:30,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:32:30,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:32:30,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:32:30,872 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:32:30,872 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:32:30,872 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:32:30,872 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:32:30,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:32:30,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:32:30,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:32:30,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:32:30 BoogieIcfgContainer [2018-11-28 12:32:30,877 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:32:30,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:32:30,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:32:30,878 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:32:30,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:32:20" (3/4) ... [2018-11-28 12:32:30,881 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:32:30,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:32:30,881 INFO L168 Benchmark]: Toolchain (without parser) took 10645.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.5 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -278.6 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:30,882 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:32:30,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:30,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.48 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-28 12:32:30,883 INFO L168 Benchmark]: Boogie Preprocessor took 24.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:30,883 INFO L168 Benchmark]: RCFGBuilder took 324.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:30,883 INFO L168 Benchmark]: BuchiAutomizer took 9931.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.3 MB). Peak memory consumption was 130.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:32:30,883 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:32:30,885 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 957.1 MB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.48 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 24.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 324.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9931.50 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.3 MB). Peak memory consumption was 130.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.1s. Construction of modules took 1.0s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 105 SDslu, 145 SDs, 0 SdLazy, 243 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital545 mio100 ax103 hnf100 lsp93 ukn44 mio100 lsp33 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...