./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/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 0d5c046770a708e0857845f9429def45b08d1347 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:00:25,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:00:25,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:00:25,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:00:25,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:00:25,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:00:25,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:00:25,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:00:25,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:00:25,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:00:25,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:00:25,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:00:25,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:00:25,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:00:25,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:00:25,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:00:25,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:00:25,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:00:25,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:00:25,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:00:25,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:00:25,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:00:25,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:00:25,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:00:25,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:00:25,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:00:25,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:00:25,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:00:25,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:00:25,898 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:00:25,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:00:25,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:00:25,899 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:00:25,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:00:25,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:00:25,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:00:25,901 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-09 22:00:25,911 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:00:25,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:00:25,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:00:25,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:00:25,913 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:00:25,913 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:00:25,913 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:00:25,913 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:00:25,913 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:00:25,913 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:00:25,914 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:00:25,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:00:25,914 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:00:25,914 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:00:25,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:00:25,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:00:25,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:00:25,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:00:25,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:00:25,915 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:00:25,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:00:25,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:00:25,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:00:25,915 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:00:25,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:00:25,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:00:25,916 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:00:25,917 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:00:25,917 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_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/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 -> 0d5c046770a708e0857845f9429def45b08d1347 [2018-11-09 22:00:25,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:00:25,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:00:25,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:00:25,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:00:25,952 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:00:25,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-09 22:00:25,993 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/data/ea3d2d085/f080c4a16a3c44c7be754a7b65c8e98d/FLAG5c21b4b90 [2018-11-09 22:00:26,411 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:00:26,411 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-09 22:00:26,417 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/data/ea3d2d085/f080c4a16a3c44c7be754a7b65c8e98d/FLAG5c21b4b90 [2018-11-09 22:00:26,426 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/bin-2019/uautomizer/data/ea3d2d085/f080c4a16a3c44c7be754a7b65c8e98d [2018-11-09 22:00:26,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:00:26,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:00:26,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:00:26,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:00:26,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:00:26,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abbe121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26, skipping insertion in model container [2018-11-09 22:00:26,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:00:26,467 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:00:26,638 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:00:26,644 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:00:26,672 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:00:26,695 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:00:26,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26 WrapperNode [2018-11-09 22:00:26,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:00:26,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:00:26,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:00:26,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:00:26,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:00:26,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:00:26,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:00:26,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:00:26,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... [2018-11-09 22:00:26,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:00:26,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:00:26,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:00:26,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:00:26,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e3e5503-3c84-4db5-a1ef-a88b9e6d6d45/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-09 22:00:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 22:00:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 22:00:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:00:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:00:27,052 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:00:27,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:00:27 BoogieIcfgContainer [2018-11-09 22:00:27,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:00:27,053 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:00:27,053 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:00:27,055 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:00:27,056 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:00:27,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:00:26" (1/3) ... [2018-11-09 22:00:27,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f309df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:00:27, skipping insertion in model container [2018-11-09 22:00:27,057 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:00:27,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:26" (2/3) ... [2018-11-09 22:00:27,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f309df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:00:27, skipping insertion in model container [2018-11-09 22:00:27,057 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:00:27,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:00:27" (3/3) ... [2018-11-09 22:00:27,058 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i [2018-11-09 22:00:27,105 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:00:27,106 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:00:27,106 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:00:27,106 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:00:27,106 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:00:27,106 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:00:27,107 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:00:27,107 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:00:27,107 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:00:27,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-09 22:00:27,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:27,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:27,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:27,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 22:00:27,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:27,144 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:00:27,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-09 22:00:27,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:27,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:27,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:27,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 22:00:27,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:27,153 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 13#L552-2true [2018-11-09 22:00:27,154 INFO L795 eck$LassoCheckResult]: Loop: 13#L552-2true assume true; 32#L551-1true SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 33#L551-2true main_#t~short7 := main_#t~mem5 > 0; 16#L551-3true assume !main_#t~short7; 25#L551-7true main_#t~short9 := main_#t~short7; 27#L551-8true assume !main_#t~short9; 14#L551-12true assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 10#L552true assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 28#L553true SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 30#L553-1true SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 31#L553-2true havoc main_#t~mem11; 26#L554true SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 8#L554-1true havoc main_#t~nondet12; 13#L552-2true [2018-11-09 22:00:27,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-09 22:00:27,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1825553361, now seen corresponding path program 1 times [2018-11-09 22:00:27,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:27,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:27,286 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-09 22:00:27,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:00:27,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:00:27,290 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:00:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:00:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:00:27,302 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-09 22:00:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:00:27,319 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-09 22:00:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:00:27,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-09 22:00:27,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:27,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 29 transitions. [2018-11-09 22:00:27,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-09 22:00:27,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-09 22:00:27,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2018-11-09 22:00:27,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:00:27,325 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-09 22:00:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2018-11-09 22:00:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-09 22:00:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-09 22:00:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-09 22:00:27,342 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-09 22:00:27,342 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-09 22:00:27,342 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:00:27,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2018-11-09 22:00:27,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:27,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:27,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:27,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 22:00:27,344 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:27,344 INFO L793 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 76#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 77#L552-2 [2018-11-09 22:00:27,344 INFO L795 eck$LassoCheckResult]: Loop: 77#L552-2 assume true; 85#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 98#L551-2 main_#t~short7 := main_#t~mem5 > 0; 86#L551-3 assume !main_#t~short7; 87#L551-7 main_#t~short9 := main_#t~short7; 93#L551-8 assume main_#t~short9; 79#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 80#L551-10 main_#t~short9 := main_#t~mem8 > 0; 84#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 81#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 82#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 95#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 97#L553-2 havoc main_#t~mem11; 94#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 78#L554-1 havoc main_#t~nondet12; 77#L552-2 [2018-11-09 22:00:27,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-09 22:00:27,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 578140596, now seen corresponding path program 1 times [2018-11-09 22:00:27,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:00:27,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:00:27,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:00:27,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 22:00:27,378 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:00:27,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 22:00:27,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 22:00:27,379 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-09 22:00:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:00:27,413 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-09 22:00:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 22:00:27,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2018-11-09 22:00:27,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:27,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 28 transitions. [2018-11-09 22:00:27,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-09 22:00:27,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-09 22:00:27,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2018-11-09 22:00:27,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:00:27,415 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-09 22:00:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2018-11-09 22:00:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-09 22:00:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-09 22:00:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-09 22:00:27,417 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-09 22:00:27,418 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-09 22:00:27,418 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:00:27,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-09 22:00:27,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:27,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:27,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:27,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-09 22:00:27,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:27,419 INFO L793 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 142#L552-2 [2018-11-09 22:00:27,419 INFO L795 eck$LassoCheckResult]: Loop: 142#L552-2 assume true; 150#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 163#L551-2 main_#t~short7 := main_#t~mem5 > 0; 151#L551-3 assume main_#t~short7; 152#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 154#L551-5 main_#t~short7 := main_#t~mem6 > 0; 156#L551-7 main_#t~short9 := main_#t~short7; 158#L551-8 assume main_#t~short9; 144#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 145#L551-10 main_#t~short9 := main_#t~mem8 > 0; 149#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 146#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 147#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 160#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 162#L553-2 havoc main_#t~mem11; 159#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 143#L554-1 havoc main_#t~nondet12; 142#L552-2 [2018-11-09 22:00:27,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,420 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-09 22:00:27,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:27,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash 900863351, now seen corresponding path program 1 times [2018-11-09 22:00:27,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:00:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:27,458 INFO L82 PathProgramCache]: Analyzing trace with hash -505033227, now seen corresponding path program 1 times [2018-11-09 22:00:27,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:27,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:27,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:27,656 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-09 22:00:27,818 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:00:27,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:00:27,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:00:27,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:00:27,819 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:00:27,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:00:27,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:00:27,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:00:27,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-09 22:00:27,820 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:00:27,820 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:00:27,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-09 22:00:27,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:27,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:27,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:27,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,102 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2018-11-09 22:00:28,235 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2018-11-09 22:00:28,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:28,662 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:00:28,665 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:00:28,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:28,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:28,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:28,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:28,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,672 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:00:28,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 22:00:28,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:28,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:28,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:28,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:28,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:28,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:28,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:28,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:28,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:28,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:28,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,698 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:00:28,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,700 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:00:28,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:28,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:28,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:28,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:28,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:28,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:28,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:28,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:28,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:28,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:28,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:28,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:28,721 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:00:28,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 22:00:28,724 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 22:00:28,726 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:00:28,726 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 22:00:28,726 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:00:28,726 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-09 22:00:28,794 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:00:28,800 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:00:28,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:28,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:28,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:28,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:28,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-09 22:00:28,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-09 22:00:28,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:28,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:28,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:28,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2018-11-09 22:00:28,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:00:28,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:00:28,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:28,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:28,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:28,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-09 22:00:28,992 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-09 22:00:28,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-09 22:00:28,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-09 22:00:29,104 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 2. Second operand 8 states. Result 64 states and 67 transitions. Complement of second has 15 states. [2018-11-09 22:00:29,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-09 22:00:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-09 22:00:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-09 22:00:29,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 2 letters. Loop has 17 letters. [2018-11-09 22:00:29,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:29,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 19 letters. Loop has 17 letters. [2018-11-09 22:00:29,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:29,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 2 letters. Loop has 34 letters. [2018-11-09 22:00:29,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:29,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2018-11-09 22:00:29,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:29,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 64 transitions. [2018-11-09 22:00:29,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-09 22:00:29,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-09 22:00:29,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 64 transitions. [2018-11-09 22:00:29,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:00:29,111 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-09 22:00:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 64 transitions. [2018-11-09 22:00:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-09 22:00:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-09 22:00:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-11-09 22:00:29,114 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-09 22:00:29,114 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-09 22:00:29,114 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 22:00:29,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 62 transitions. [2018-11-09 22:00:29,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:29,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:29,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:29,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:29,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:29,115 INFO L793 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 433#L552-2 assume true; 448#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 485#L551-2 main_#t~short7 := main_#t~mem5 > 0; 484#L551-3 assume main_#t~short7; 483#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 482#L551-5 main_#t~short7 := main_#t~mem6 > 0; 481#L551-7 main_#t~short9 := main_#t~short7; 480#L551-8 assume main_#t~short9; 479#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 478#L551-10 main_#t~short9 := main_#t~mem8 > 0; 450#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 442#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 443#L556 [2018-11-09 22:00:29,115 INFO L795 eck$LassoCheckResult]: Loop: 443#L556 SUMMARY for call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 461#L556-1 havoc main_#t~nondet13; 428#L557 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 429#L557-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-1 430#L557-2 havoc main_#t~mem14; 431#L558 SUMMARY for call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L558 455#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4); srcloc: L558-1 458#L558-2 havoc main_#t~mem15; 462#L552-2 assume true; 474#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 475#L551-2 main_#t~short7 := main_#t~mem5 > 0; 451#L551-3 assume main_#t~short7; 452#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 456#L551-5 main_#t~short7 := main_#t~mem6 > 0; 459#L551-7 main_#t~short9 := main_#t~short7; 463#L551-8 assume main_#t~short9; 438#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 439#L551-10 main_#t~short9 := main_#t~mem8 > 0; 446#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 477#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 443#L556 [2018-11-09 22:00:29,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash -521460809, now seen corresponding path program 1 times [2018-11-09 22:00:29,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:29,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:29,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:29,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1105561849, now seen corresponding path program 1 times [2018-11-09 22:00:29,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:29,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:29,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1570747823, now seen corresponding path program 1 times [2018-11-09 22:00:29,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:29,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:29,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:29,379 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2018-11-09 22:00:29,579 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 88 [2018-11-09 22:00:29,633 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:00:29,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:00:29,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:00:29,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:00:29,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:00:29,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:00:29,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:00:29,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:00:29,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-09 22:00:29,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:00:29,634 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:00:29,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,829 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2018-11-09 22:00:29,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:29,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:30,391 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:00:30,392 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:00:30,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:30,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:30,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:30,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:30,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:30,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:30,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:30,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:30,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:30,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:30,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:30,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:30,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:30,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:30,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:30,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:30,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:30,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:30,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:30,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:30,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:30,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:30,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:30,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:30,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:30,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:30,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:30,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:30,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:30,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:30,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:30,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:30,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:30,412 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:00:30,419 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-09 22:00:30,420 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 22:00:30,420 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:00:30,421 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:00:30,421 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:00:30,421 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-09 22:00:30,471 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:00:30,472 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:00:30,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:30,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:30,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-09 22:00:30,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-09 22:00:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:30,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:30,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:00:30,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:00:30,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-11-09 22:00:30,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:30,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:00:30,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:00:30,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:00:30,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:30,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-11-09 22:00:30,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-09 22:00:30,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:30,615 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:30,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-09 22:00:30,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-09 22:00:30,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:00:30,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:00:30,658 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:60 [2018-11-09 22:00:47,406 WARN L179 SmtUtils]: Spent 16.48 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-11-09 22:00:47,460 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-09 22:00:47,460 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2018-11-09 22:00:47,460 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-09 22:00:47,677 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 108 states and 113 transitions. Complement of second has 20 states. [2018-11-09 22:00:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-09 22:00:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-09 22:00:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2018-11-09 22:00:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 14 letters. Loop has 20 letters. [2018-11-09 22:00:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 34 letters. Loop has 20 letters. [2018-11-09 22:00:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 14 letters. Loop has 40 letters. [2018-11-09 22:00:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:47,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 113 transitions. [2018-11-09 22:00:47,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:47,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 87 states and 91 transitions. [2018-11-09 22:00:47,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-09 22:00:47,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-09 22:00:47,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 91 transitions. [2018-11-09 22:00:47,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:00:47,682 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-09 22:00:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 91 transitions. [2018-11-09 22:00:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-09 22:00:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-09 22:00:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-09 22:00:47,685 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-09 22:00:47,685 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-09 22:00:47,685 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 22:00:47,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 87 transitions. [2018-11-09 22:00:47,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:47,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:47,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:47,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:47,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:47,687 INFO L793 eck$LassoCheckResult]: Stem: 907#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 862#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 863#L552-2 assume true; 879#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 911#L551-2 main_#t~short7 := main_#t~mem5 > 0; 883#L551-3 assume main_#t~short7; 884#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 889#L551-5 main_#t~short7 := main_#t~mem6 > 0; 893#L551-7 main_#t~short9 := main_#t~short7; 901#L551-8 assume main_#t~short9; 868#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 869#L551-10 main_#t~short9 := main_#t~mem8 > 0; 881#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 882#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 897#L556 SUMMARY for call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 898#L556-1 havoc main_#t~nondet13; 856#L557 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 857#L557-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-1 859#L557-2 havoc main_#t~mem14; 861#L558 SUMMARY for call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L558 888#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4); srcloc: L558-1 892#L558-2 havoc main_#t~mem15; 896#L552-2 assume true; 936#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 935#L551-2 main_#t~short7 := main_#t~mem5 > 0; 934#L551-3 assume main_#t~short7; 933#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 932#L551-5 main_#t~short7 := main_#t~mem6 > 0; 931#L551-7 main_#t~short9 := main_#t~short7; 930#L551-8 assume main_#t~short9; 928#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 876#L551-10 main_#t~short9 := main_#t~mem8 > 0; 877#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 872#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 873#L553 [2018-11-09 22:00:47,687 INFO L795 eck$LassoCheckResult]: Loop: 873#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 905#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 908#L553-2 havoc main_#t~mem11; 910#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 929#L554-1 havoc main_#t~nondet12; 895#L552-2 assume true; 926#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 924#L551-2 main_#t~short7 := main_#t~mem5 > 0; 923#L551-3 assume main_#t~short7; 922#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 921#L551-5 main_#t~short7 := main_#t~mem6 > 0; 920#L551-7 main_#t~short9 := main_#t~short7; 919#L551-8 assume main_#t~short9; 918#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 917#L551-10 main_#t~short9 := main_#t~mem8 > 0; 916#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 915#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 873#L553 [2018-11-09 22:00:47,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1570747816, now seen corresponding path program 1 times [2018-11-09 22:00:47,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:47,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:47,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:47,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:47,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:47,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 133194417, now seen corresponding path program 2 times [2018-11-09 22:00:47,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:47,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:47,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:47,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:47,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:47,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 473681898, now seen corresponding path program 1 times [2018-11-09 22:00:47,718 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:47,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:47,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:47,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:00:47,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:47,862 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-11-09 22:00:48,253 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 135 [2018-11-09 22:00:48,343 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:00:48,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:00:48,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:00:48,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:00:48,344 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:00:48,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:00:48,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:00:48,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:00:48,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-09 22:00:48,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:00:48,344 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:00:48,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,588 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2018-11-09 22:00:48,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:48,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:49,023 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:00:49,023 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:00:49,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:49,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:49,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:49,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:49,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:49,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:49,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:49,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:49,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:49,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:49,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:49,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:49,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:49,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:49,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:49,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:49,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,035 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:00:49,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,036 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:00:49,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:49,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:49,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:49,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:49,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:49,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:49,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:49,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:49,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:49,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:49,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:49,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:49,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:00:49,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 22:00:49,065 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 22:00:49,066 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:00:49,066 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:00:49,067 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:00:49,067 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-09 22:00:49,130 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:00:49,132 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:00:49,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:49,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:49,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:49,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 22:00:49,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:49,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:49,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 22:00:49,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-09 22:00:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:49,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:49,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:49,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:00:49,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:00:49,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:00:49,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:00:49,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:00:49,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:49,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-09 22:00:49,276 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-09 22:00:49,276 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-09 22:00:49,276 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 87 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-09 22:00:49,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 87 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 197 states and 205 transitions. Complement of second has 14 states. [2018-11-09 22:00:49,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-09 22:00:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-09 22:00:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-09 22:00:49,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 34 letters. Loop has 17 letters. [2018-11-09 22:00:49,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:49,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 51 letters. Loop has 17 letters. [2018-11-09 22:00:49,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:49,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 34 letters. Loop has 34 letters. [2018-11-09 22:00:49,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:49,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 205 transitions. [2018-11-09 22:00:49,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:49,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 156 states and 162 transitions. [2018-11-09 22:00:49,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-09 22:00:49,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-09 22:00:49,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 162 transitions. [2018-11-09 22:00:49,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:00:49,354 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-11-09 22:00:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 162 transitions. [2018-11-09 22:00:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-11-09 22:00:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-09 22:00:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-11-09 22:00:49,359 INFO L728 BuchiCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-11-09 22:00:49,359 INFO L608 BuchiCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-11-09 22:00:49,359 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-09 22:00:49,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 149 transitions. [2018-11-09 22:00:49,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-09 22:00:49,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:00:49,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:00:49,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:49,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:00:49,361 INFO L793 eck$LassoCheckResult]: Stem: 1482#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1437#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1438#L552-2 assume true; 1560#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1558#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1556#L551-3 assume main_#t~short7; 1554#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1552#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1550#L551-7 main_#t~short9 := main_#t~short7; 1548#L551-8 assume main_#t~short9; 1546#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 1544#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1542#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1540#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 1470#L556 SUMMARY for call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 1471#L556-1 havoc main_#t~nondet13; 1430#L557 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 1431#L557-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-1 1507#L557-2 havoc main_#t~mem14; 1506#L558 SUMMARY for call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L558 1505#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4); srcloc: L558-1 1504#L558-2 havoc main_#t~mem15; 1503#L552-2 assume true; 1502#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1501#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1500#L551-3 assume main_#t~short7; 1499#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1498#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1497#L551-7 main_#t~short9 := main_#t~short7; 1496#L551-8 assume main_#t~short9; 1494#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 1493#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1492#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1491#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 1479#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 1480#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 1485#L553-2 havoc main_#t~mem11; 1486#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 1563#L554-1 havoc main_#t~nondet12; 1562#L552-2 assume true; 1561#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1559#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1557#L551-3 assume main_#t~short7; 1555#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1466#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1467#L551-7 main_#t~short9 := main_#t~short7; 1474#L551-8 assume main_#t~short9; 1478#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 1567#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1566#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1447#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 1448#L556 [2018-11-09 22:00:49,361 INFO L795 eck$LassoCheckResult]: Loop: 1448#L556 SUMMARY for call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 1473#L556-1 havoc main_#t~nondet13; 1428#L557 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 1429#L557-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-1 1432#L557-2 havoc main_#t~mem14; 1435#L558 SUMMARY for call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L558 1460#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4); srcloc: L558-1 1464#L558-2 havoc main_#t~mem15; 1440#L552-2 assume true; 1453#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1487#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1456#L551-3 assume main_#t~short7; 1457#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1462#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1569#L551-7 main_#t~short9 := main_#t~short7; 1568#L551-8 assume main_#t~short9; 1443#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 1444#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1451#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1455#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 1448#L556 [2018-11-09 22:00:49,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash 473681905, now seen corresponding path program 2 times [2018-11-09 22:00:49,362 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:00:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:49,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:49,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1105561849, now seen corresponding path program 2 times [2018-11-09 22:00:49,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:49,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:49,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:00:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:49,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:49,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1888092393, now seen corresponding path program 3 times [2018-11-09 22:00:49,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:00:49,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:00:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:49,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:00:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:00:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:00:49,613 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2018-11-09 22:00:50,355 WARN L179 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 167 [2018-11-09 22:00:50,487 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-09 22:00:50,490 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:00:50,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:00:50,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:00:50,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:00:50,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:00:50,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:00:50,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:00:50,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:00:50,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-09 22:00:50,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:00:50,490 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:00:50,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,738 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-11-09 22:00:50,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-09 22:00:50,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-09 22:00:50,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-09 22:00:50,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-09 22:00:50,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-09 22:00:50,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-09 22:00:50,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:50,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:00:51,196 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:00:51,196 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:00:51,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:51,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:51,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:51,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:51,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:51,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:51,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:00:51,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:00:51,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:00:51,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,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-09 22:00:51,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,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-09 22:00:51,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,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-09 22:00:51,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,220 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:00:51,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,220 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:00:51,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,224 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:00:51,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,225 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:00:51,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,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-09 22:00:51,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,229 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:00:51,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:00:51,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,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-09 22:00:51,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:00:51,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:00:51,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:00:51,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:00:51,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:00:51,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:00:51,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:00:51,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:00:51,270 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:00:51,272 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 22:00:51,272 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 22:00:51,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:00:51,273 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:00:51,274 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:00:51,274 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-09 22:00:51,347 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:00:51,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:00:51,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:51,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:51,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-09 22:00:51,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-09 22:00:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:51,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:51,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:00:51,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:00:51,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-11-09 22:00:51,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:51,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:00:51,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:00:51,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:00:51,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:51,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-11-09 22:00:51,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2018-11-09 22:00:51,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-09 22:00:51,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:51,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-09 22:00:51,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:51,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:00:51,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:00:51,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:60 [2018-11-09 22:00:58,589 WARN L179 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-11-09 22:00:58,633 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-09 22:00:58,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2018-11-09 22:00:58,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 149 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-09 22:00:58,907 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 149 transitions. cyclomatic complexity: 11. Second operand 15 states. Result 204 states and 212 transitions. Complement of second has 20 states. [2018-11-09 22:00:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-09 22:00:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-09 22:00:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2018-11-09 22:00:58,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 45 transitions. Stem has 51 letters. Loop has 20 letters. [2018-11-09 22:00:58,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:00:58,908 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 22:00:58,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:00:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:58,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:58,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-09 22:00:58,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-09 22:00:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:00:58,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:00:58,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:00:58,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:00:58,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-11-09 22:00:58,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:58,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:00:58,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:00:58,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:00:58,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:00:59,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:59,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-11-09 22:00:59,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-09 22:00:59,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:00:59,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:00:59,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-09 22:00:59,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-09 22:00:59,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:00:59,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:00:59,093 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:60 [2018-11-09 22:01:16,940 WARN L179 SmtUtils]: Spent 16.24 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-11-09 22:01:16,986 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-09 22:01:16,987 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 12 loop predicates [2018-11-09 22:01:16,987 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 149 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-09 22:01:19,629 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-11-09 22:01:31,779 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 149 transitions. cyclomatic complexity: 11. Second operand 15 states. Result 202 states and 210 transitions. Complement of second has 30 states. [2018-11-09 22:01:31,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-09 22:01:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-09 22:01:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 44 transitions. [2018-11-09 22:01:31,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 44 transitions. Stem has 51 letters. Loop has 20 letters. [2018-11-09 22:01:31,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:31,781 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 22:01:31,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:31,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:31,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-09 22:01:31,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-09 22:01:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:31,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:31,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:01:31,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:01:31,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-11-09 22:01:31,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:31,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:01:31,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:01:31,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:01:31,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:31,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-11-09 22:01:31,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-09 22:01:31,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:31,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:31,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-09 22:01:31,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-09 22:01:31,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:01:31,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 22:01:31,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:60 [2018-11-09 22:01:36,104 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-11-09 22:01:36,147 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-09 22:01:36,147 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2018-11-09 22:01:36,147 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 149 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-09 22:01:36,362 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 149 transitions. cyclomatic complexity: 11. Second operand 15 states. Result 236 states and 247 transitions. Complement of second has 21 states. [2018-11-09 22:01:36,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-09 22:01:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-09 22:01:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2018-11-09 22:01:36,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 54 transitions. Stem has 51 letters. Loop has 20 letters. [2018-11-09 22:01:36,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:36,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 54 transitions. Stem has 71 letters. Loop has 20 letters. [2018-11-09 22:01:36,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:36,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 54 transitions. Stem has 51 letters. Loop has 40 letters. [2018-11-09 22:01:36,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:36,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 236 states and 247 transitions. [2018-11-09 22:01:36,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-09 22:01:36,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 236 states to 166 states and 173 transitions. [2018-11-09 22:01:36,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-11-09 22:01:36,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-09 22:01:36,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 173 transitions. [2018-11-09 22:01:36,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:01:36,369 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-11-09 22:01:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 173 transitions. [2018-11-09 22:01:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2018-11-09 22:01:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-09 22:01:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-11-09 22:01:36,373 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-11-09 22:01:36,373 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-11-09 22:01:36,373 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-09 22:01:36,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 134 transitions. [2018-11-09 22:01:36,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-09 22:01:36,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:01:36,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:01:36,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:01:36,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:01:36,376 INFO L793 eck$LassoCheckResult]: Stem: 3161#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3120#L552-2 assume true; 3181#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3180#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3179#L551-3 assume main_#t~short7; 3178#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3177#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3176#L551-7 main_#t~short9 := main_#t~short7; 3175#L551-8 assume main_#t~short9; 3174#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3173#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3172#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3169#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 3170#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3229#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3228#L553-2 havoc main_#t~mem11; 3227#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 3121#L554-1 havoc main_#t~nondet12; 3122#L552-2 assume true; 3136#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3166#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3224#L551-3 assume main_#t~short7; 3145#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3146#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3149#L551-7 main_#t~short9 := main_#t~short7; 3220#L551-8 assume main_#t~short9; 3219#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3218#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3217#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3130#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3131#L556 [2018-11-09 22:01:36,376 INFO L795 eck$LassoCheckResult]: Loop: 3131#L556 SUMMARY for call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 3151#L556-1 havoc main_#t~nondet13; 3115#L557 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 3116#L557-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-1 3117#L557-2 havoc main_#t~mem14; 3118#L558 SUMMARY for call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L558 3144#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4); srcloc: L558-1 3148#L558-2 havoc main_#t~mem15; 3137#L552-2 assume true; 3138#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3167#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3142#L551-3 assume main_#t~short7; 3143#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3147#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3150#L551-7 main_#t~short9 := main_#t~short7; 3154#L551-8 assume main_#t~short9; 3127#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3128#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3134#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3139#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 3171#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3162#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3163#L553-2 havoc main_#t~mem11; 3155#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 3156#L554-1 havoc main_#t~nondet12; 3226#L552-2 assume true; 3225#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3168#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3140#L551-3 assume main_#t~short7; 3141#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3223#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3152#L551-7 main_#t~short9 := main_#t~short7; 3153#L551-8 assume main_#t~short9; 3125#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3126#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3222#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3221#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3131#L556 [2018-11-09 22:01:36,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 201929449, now seen corresponding path program 1 times [2018-11-09 22:01:36,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:01:36,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:01:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:36,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:01:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:36,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1172194841, now seen corresponding path program 1 times [2018-11-09 22:01:36,391 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:01:36,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:01:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:36,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:01:36,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:36,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash 86882303, now seen corresponding path program 4 times [2018-11-09 22:01:36,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:01:36,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:01:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:36,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:01:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:36,803 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 110 [2018-11-09 22:01:37,171 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 125 [2018-11-09 22:01:37,259 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:01:37,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:01:37,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:01:37,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:01:37,259 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:01:37,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:01:37,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:01:37,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:01:37,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-09 22:01:37,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:01:37,259 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:01:37,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,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-09 22:01:37,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-09 22:01:37,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,475 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2018-11-09 22:01:37,589 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-11-09 22:01:37,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:37,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:38,003 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:01:38,003 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:01:38,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:38,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:38,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:38,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:38,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:01:38,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,006 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 22:01:38,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:38,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:38,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:38,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:38,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:38,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:38,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:38,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:38,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:38,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:38,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:38,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:38,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:38,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:38,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:38,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:38,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:38,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:38,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:38,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:38,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:38,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:38,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:38,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:38,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:38,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:38,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:38,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:38,043 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:01:38,046 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 22:01:38,046 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 22:01:38,047 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:01:38,047 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:01:38,047 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:01:38,048 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 Supporting invariants [] [2018-11-09 22:01:38,126 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:01:38,128 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:01:38,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:38,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:38,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:38,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 22:01:38,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:38,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:38,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 22:01:38,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-09 22:01:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:38,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:38,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-09 22:01:38,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:01:38,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:16 [2018-11-09 22:01:38,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:38,219 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:01:38,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:01:38,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-09 22:01:38,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-09 22:01:38,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:01:38,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:18 [2018-11-09 22:01:38,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-09 22:01:38,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-09 22:01:38,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-11-09 22:01:38,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:01:38,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:01:38,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:38,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-09 22:01:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 22:01:38,345 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-09 22:01:38,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 134 transitions. cyclomatic complexity: 10 Second operand 10 states. [2018-11-09 22:01:38,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 134 transitions. cyclomatic complexity: 10. Second operand 10 states. Result 225 states and 237 transitions. Complement of second has 15 states. [2018-11-09 22:01:38,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-09 22:01:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-09 22:01:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-11-09 22:01:38,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 56 transitions. Stem has 31 letters. Loop has 37 letters. [2018-11-09 22:01:38,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:38,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 56 transitions. Stem has 68 letters. Loop has 37 letters. [2018-11-09 22:01:38,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:38,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 56 transitions. Stem has 31 letters. Loop has 74 letters. [2018-11-09 22:01:38,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:38,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 237 transitions. [2018-11-09 22:01:38,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-09 22:01:38,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 156 states and 163 transitions. [2018-11-09 22:01:38,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-09 22:01:38,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-09 22:01:38,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 163 transitions. [2018-11-09 22:01:38,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:01:38,488 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 163 transitions. [2018-11-09 22:01:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 163 transitions. [2018-11-09 22:01:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 145. [2018-11-09 22:01:38,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-09 22:01:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-11-09 22:01:38,493 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-11-09 22:01:38,493 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-11-09 22:01:38,494 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-09 22:01:38,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 152 transitions. [2018-11-09 22:01:38,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-09 22:01:38,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:01:38,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:01:38,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:01:38,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:01:38,496 INFO L793 eck$LassoCheckResult]: Stem: 3880#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3824#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~nondet13, main_#t~mem14, main_#t~mem15, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~d~0.base, main_~d~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~d~0.base, main_~d~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3825#L552-2 assume true; 3922#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3921#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3920#L551-3 assume main_#t~short7; 3919#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3918#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3917#L551-7 main_#t~short9 := main_#t~short7; 3916#L551-8 assume main_#t~short9; 3915#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3914#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3913#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3912#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 3911#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3910#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3908#L553-2 havoc main_#t~mem11; 3907#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 3826#L554-1 havoc main_#t~nondet12; 3827#L552-2 assume true; 3840#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3886#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3844#L551-3 assume main_#t~short7; 3845#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3857#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3858#L551-7 main_#t~short9 := main_#t~short7; 3867#L551-8 assume main_#t~short9; 3897#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3898#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3893#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3894#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3860#L556 SUMMARY for call write~int(main_#t~nondet13, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 3861#L556-1 havoc main_#t~nondet13; 3818#L557 SUMMARY for call main_#t~mem14 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L557 3819#L557-1 SUMMARY for call write~int(main_#t~mem14 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L557-1 3822#L557-2 havoc main_#t~mem14; 3823#L558 SUMMARY for call main_#t~mem15 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L558 3855#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~d~0.base, main_~d~0.offset, 4); srcloc: L558-1 3856#L558-2 havoc main_#t~mem15; 3936#L552-2 assume true; 3935#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3934#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3933#L551-3 assume main_#t~short7; 3932#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3931#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3930#L551-7 main_#t~short9 := main_#t~short7; 3929#L551-8 assume main_#t~short9; 3926#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3831#L551-10 [2018-11-09 22:01:38,496 INFO L795 eck$LassoCheckResult]: Loop: 3831#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3838#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3843#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 3876#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3877#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3881#L553-2 havoc main_#t~mem11; 3870#L554 SUMMARY for call write~int(main_#t~nondet12, main_~d~0.base, main_~d~0.offset, 4); srcloc: L554 3871#L554-1 havoc main_#t~nondet12; 3906#L552-2 assume true; 3905#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3904#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3903#L551-3 assume main_#t~short7; 3902#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3901#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3900#L551-7 main_#t~short9 := main_#t~short7; 3899#L551-8 assume main_#t~short9; 3830#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~d~0.base, main_~d~0.offset, 4); srcloc: L551-9 3831#L551-10 [2018-11-09 22:01:38,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1356462496, now seen corresponding path program 5 times [2018-11-09 22:01:38,496 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:01:38,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:01:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:38,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:01:38,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:38,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash -953809023, now seen corresponding path program 3 times [2018-11-09 22:01:38,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:01:38,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:01:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:38,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:01:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:38,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:38,525 INFO L82 PathProgramCache]: Analyzing trace with hash -433083646, now seen corresponding path program 6 times [2018-11-09 22:01:38,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:01:38,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:01:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:38,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:01:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:01:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:01:38,674 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-11-09 22:01:39,397 WARN L179 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 167 [2018-11-09 22:01:39,558 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-09 22:01:39,560 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:01:39,561 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:01:39,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:01:39,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:01:39,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:01:39,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:01:39,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:01:39,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:01:39,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7a-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-09 22:01:39,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:01:39,561 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:01:39,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,895 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 105 [2018-11-09 22:01:39,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:39,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:01:40,354 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:01:40,354 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:01:40,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:40,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:40,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:40,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:40,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:40,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:40,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:40,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:40,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:40,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:40,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:01:40,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:40,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:01:40,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,379 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:01:40,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,380 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 22:01:40,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:01:40,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,396 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:01:40,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,397 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:01:40,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,404 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:01:40,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,405 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:01:40,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,408 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:01:40,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,409 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:01:40,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:01:40,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 22:01:40,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:01:40,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:01:40,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:01:40,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:01:40,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:01:40,423 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:01:40,427 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:01:40,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 22:01:40,430 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-09 22:01:40,431 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:01:40,431 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:01:40,431 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:01:40,431 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6 Supporting invariants [] [2018-11-09 22:01:40,532 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-09 22:01:40,534 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-09 22:01:40,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:40,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:40,576 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 22:01:40,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 22:01:40,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-09 22:01:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:40,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:40,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:01:40,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:01:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:01:40,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:01:40,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:01:40,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-09 22:01:40,693 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-09 22:01:40,693 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-09 22:01:40,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 152 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-09 22:01:40,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 152 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 187 states and 195 transitions. Complement of second has 14 states. [2018-11-09 22:01:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-09 22:01:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-09 22:01:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-09 22:01:40,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 48 letters. Loop has 17 letters. [2018-11-09 22:01:40,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:40,775 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 22:01:40,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:40,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:40,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 22:01:40,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,820 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 22:01:40,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-09 22:01:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:40,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:40,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:40,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:01:40,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:01:40,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:01:40,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:01:40,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:01:40,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:40,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-09 22:01:40,939 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-09 22:01:40,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-09 22:01:40,939 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 152 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-09 22:01:41,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 152 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 186 states and 193 transitions. Complement of second has 16 states. [2018-11-09 22:01:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-09 22:01:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-09 22:01:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-11-09 22:01:41,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 29 transitions. Stem has 48 letters. Loop has 17 letters. [2018-11-09 22:01:41,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:41,016 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-09 22:01:41,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:01:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:41,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:41,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:41,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-09 22:01:41,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:41,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:41,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-09 22:01:41,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-09 22:01:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:01:41,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:01:41,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 22:01:41,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-09 22:01:41,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-09 22:01:41,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-09 22:01:41,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-09 22:01:41,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-09 22:01:41,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 22:01:41,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-09 22:01:41,196 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-09 22:01:41,196 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-09 22:01:41,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 145 states and 152 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-09 22:01:41,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 145 states and 152 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 251 states and 264 transitions. Complement of second has 15 states. [2018-11-09 22:01:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-09 22:01:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-09 22:01:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2018-11-09 22:01:41,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 48 letters. Loop has 17 letters. [2018-11-09 22:01:41,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:41,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 65 letters. Loop has 17 letters. [2018-11-09 22:01:41,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:41,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 48 transitions. Stem has 48 letters. Loop has 34 letters. [2018-11-09 22:01:41,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:01:41,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 264 transitions. [2018-11-09 22:01:41,315 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:01:41,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 0 states and 0 transitions. [2018-11-09 22:01:41,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:01:41,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:01:41,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:01:41,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:01:41,315 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:01:41,315 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:01:41,315 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:01:41,315 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-09 22:01:41,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:01:41,316 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:01:41,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:01:41,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:01:41 BoogieIcfgContainer [2018-11-09 22:01:41,321 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:01:41,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:01:41,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:01:41,322 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:01:41,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:00:27" (3/4) ... [2018-11-09 22:01:41,325 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:01:41,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:01:41,326 INFO L168 Benchmark]: Toolchain (without parser) took 74897.40 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 201.4 MB. Max. memory is 11.5 GB. [2018-11-09 22:01:41,326 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:01:41,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.05 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-09 22:01:41,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -209.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:01:41,327 INFO L168 Benchmark]: Boogie Preprocessor took 14.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:01:41,327 INFO L168 Benchmark]: RCFGBuilder took 274.34 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:01:41,327 INFO L168 Benchmark]: BuchiAutomizer took 74268.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 214.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:01:41,328 INFO L168 Benchmark]: Witness Printer took 3.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:01:41,329 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.05 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -209.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 274.34 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 74268.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 214.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 11 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 11 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 74.2s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 10.1s. Construction of modules took 12.4s. Büchi inclusion checks took 51.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 145 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 11/12 HoareTripleCheckerStatistics: 306 SDtfs, 525 SDslu, 507 SDs, 0 SdLazy, 658 SolverSat, 107 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital726 mio100 ax103 hnf100 lsp94 ukn50 mio100 lsp38 div100 bol100 ite100 ukn100 eq200 hnf87 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...