./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e3ac7e4caefab280af1b902717cbfa5c070462d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:01:11,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:01:11,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:01:11,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:01:11,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:01:11,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:01:11,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:01:11,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:01:11,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:01:11,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:01:11,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:01:11,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:01:11,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:01:11,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:01:11,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:01:11,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:01:11,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:01:11,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:01:11,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:01:11,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:01:11,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:01:11,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:01:11,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:01:11,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:01:11,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:01:11,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:01:11,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:01:11,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:01:11,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:01:11,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:01:11,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:01:11,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:01:11,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:01:11,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:01:11,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:01:11,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:01:11,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:01:11,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:01:11,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:01:11,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:01:11,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:01:11,656 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:01:11,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:01:11,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:01:11,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:01:11,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:01:11,679 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:01:11,679 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:01:11,679 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:01:11,679 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:01:11,679 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:01:11,680 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:01:11,681 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:01:11,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:01:11,681 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:01:11,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:01:11,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:01:11,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:01:11,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:01:11,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:01:11,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:01:11,682 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:01:11,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:01:11,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:01:11,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:01:11,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:01:11,683 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:01:11,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:01:11,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:01:11,684 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:01:11,686 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:01:11,686 INFO L138 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/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3ac7e4caefab280af1b902717cbfa5c070462d8 [2019-11-15 21:01:11,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:01:11,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:01:11,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:01:11,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:01:11,750 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:01:11,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i [2019-11-15 21:01:11,813 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/data/bc421141c/199b69e0ff71458e9232ab35a5bcd7bc/FLAG369650bf7 [2019-11-15 21:01:12,230 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:01:12,230 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/sv-benchmarks/c/termination-memory-alloca/min_rf-alloca.i [2019-11-15 21:01:12,240 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/data/bc421141c/199b69e0ff71458e9232ab35a5bcd7bc/FLAG369650bf7 [2019-11-15 21:01:12,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/data/bc421141c/199b69e0ff71458e9232ab35a5bcd7bc [2019-11-15 21:01:12,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:01:12,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:01:12,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:01:12,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:01:12,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:01:12,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:01:12" (1/1) ... [2019-11-15 21:01:12,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71136f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:12, skipping insertion in model container [2019-11-15 21:01:12,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:01:12" (1/1) ... [2019-11-15 21:01:12,563 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:01:12,614 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:01:12,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:01:12,977 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:01:13,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:01:13,076 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:01:13,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13 WrapperNode [2019-11-15 21:01:13,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:01:13,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:01:13,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:01:13,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:01:13,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:01:13,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:01:13,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:01:13,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:01:13,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... [2019-11-15 21:01:13,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:01:13,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:01:13,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:01:13,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:01:13,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/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 [2019-11-15 21:01:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:01:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:01:13,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:01:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:01:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:01:13,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:01:13,506 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:01:13,507 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:01:13,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:01:13 BoogieIcfgContainer [2019-11-15 21:01:13,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:01:13,509 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:01:13,509 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:01:13,512 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:01:13,513 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:01:13,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:01:12" (1/3) ... [2019-11-15 21:01:13,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4792377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:01:13, skipping insertion in model container [2019-11-15 21:01:13,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:01:13,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:01:13" (2/3) ... [2019-11-15 21:01:13,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4792377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:01:13, skipping insertion in model container [2019-11-15 21:01:13,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:01:13,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:01:13" (3/3) ... [2019-11-15 21:01:13,516 INFO L371 chiAutomizerObserver]: Analyzing ICFG min_rf-alloca.i [2019-11-15 21:01:13,553 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:01:13,553 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:01:13,553 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:01:13,553 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:01:13,553 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:01:13,553 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:01:13,554 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:01:13,554 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:01:13,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 21:01:13,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:01:13,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:01:13,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:01:13,587 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:01:13,587 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:01:13,587 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:01:13,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 21:01:13,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:01:13,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:01:13,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:01:13,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:01:13,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:01:13,594 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 11#L556-1true [2019-11-15 21:01:13,595 INFO L793 eck$LassoCheckResult]: Loop: 11#L556-1true call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 7#L553-1true assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 10#L553-3true assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 13#L554true assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 8#L554-2true assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 11#L556-1true [2019-11-15 21:01:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 21:01:13,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:13,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878205013] [2019-11-15 21:01:13,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:13,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:13,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:13,739 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 35409684, now seen corresponding path program 1 times [2019-11-15 21:01:13,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:13,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656010457] [2019-11-15 21:01:13,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:13,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:13,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:13,794 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849170, now seen corresponding path program 1 times [2019-11-15 21:01:13,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:13,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352596191] [2019-11-15 21:01:13,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:13,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:13,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:13,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:14,290 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-11-15 21:01:14,717 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-11-15 21:01:14,856 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 21:01:14,869 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:01:14,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:01:14,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:01:14,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:01:14,871 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:01:14,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:01:14,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:01:14,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:01:14,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca.i_Iteration1_Lasso [2019-11-15 21:01:14,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:01:14,872 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:01:14,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:14,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:15,363 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-15 21:01:15,545 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-15 21:01:15,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:15,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:15,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:15,812 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-15 21:01:16,587 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 21:01:16,621 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:01:16,630 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:01:16,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,668 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,684 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,688 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,689 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,700 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,700 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,700 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,706 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,723 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,733 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,733 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,733 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,740 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,740 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,751 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,751 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,756 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,757 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,761 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,763 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:01:16,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,764 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:01:16,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,781 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:16,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:16,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:16,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,813 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,833 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,833 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,862 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,862 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,878 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,878 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,929 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:16,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:16,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:16,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:16,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:16,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:16,941 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:16,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:16,985 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:01:17,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:01:17,007 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:01:17,010 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:01:17,015 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:01:17,015 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:01:17,016 INFO L512 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 [] [2019-11-15 21:01:17,105 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 21:01:17,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:01:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:01:17,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:01:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:17,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:01:17,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:01:17,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:17,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:17,349 INFO L375 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 1 case distinctions, treesize of input 43 treesize of output 45 [2019-11-15 21:01:17,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:01:17,379 INFO L567 ElimStorePlain]: treesize reduction 20, result has 70.1 percent of original size [2019-11-15 21:01:17,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:01:17,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-11-15 21:01:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:01:17,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-15 21:01:17,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 6 states. [2019-11-15 21:01:17,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 6 states. Result 45 states and 56 transitions. Complement of second has 14 states. [2019-11-15 21:01:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 21:01:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:01:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-11-15 21:01:17,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-15 21:01:17,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:01:17,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 21:01:17,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:01:17,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-15 21:01:17,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:01:17,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-11-15 21:01:17,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:01:17,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 29 transitions. [2019-11-15 21:01:17,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:01:17,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:01:17,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-11-15 21:01:17,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:01:17,646 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 21:01:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-11-15 21:01:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-15 21:01:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:01:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-15 21:01:17,670 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-15 21:01:17,670 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-15 21:01:17,671 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:01:17,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-15 21:01:17,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:01:17,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:01:17,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:01:17,672 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:01:17,672 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:01:17,673 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 218#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 219#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 221#L553-1 assume !main_#t~short9; 222#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 229#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 233#L554-2 [2019-11-15 21:01:17,673 INFO L793 eck$LassoCheckResult]: Loop: 233#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 226#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 231#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 234#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 232#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 233#L554-2 [2019-11-15 21:01:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2019-11-15 21:01:17,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:17,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017400264] [2019-11-15 21:01:17,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:17,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:17,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:01:17,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017400264] [2019-11-15 21:01:17,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:01:17,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:01:17,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984050918] [2019-11-15 21:01:17,740 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:01:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 2 times [2019-11-15 21:01:17,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:17,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574715577] [2019-11-15 21:01:17,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:17,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:17,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:17,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:18,049 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-11-15 21:01:18,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:01:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:01:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:01:18,116 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-15 21:01:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:01:18,125 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-11-15 21:01:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:01:18,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2019-11-15 21:01:18,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:01:18,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 22 transitions. [2019-11-15 21:01:18,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 21:01:18,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:01:18,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-15 21:01:18,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:01:18,129 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 21:01:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-15 21:01:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 21:01:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:01:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-15 21:01:18,131 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 21:01:18,132 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 21:01:18,132 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:01:18,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-11-15 21:01:18,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:01:18,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:01:18,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:01:18,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:01:18,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:01:18,133 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 262#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 264#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 265#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 272#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 275#L554-2 [2019-11-15 21:01:18,133 INFO L793 eck$LassoCheckResult]: Loop: 275#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 269#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 274#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 277#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 276#L554 assume main_#t~mem10 > main_#t~mem11;havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem12 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem12, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem12; 275#L554-2 [2019-11-15 21:01:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2019-11-15 21:01:18,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:18,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022867921] [2019-11-15 21:01:18,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:18,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:18,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:18,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash 53782944, now seen corresponding path program 3 times [2019-11-15 21:01:18,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:18,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190904831] [2019-11-15 21:01:18,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:18,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:18,179 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash -304168138, now seen corresponding path program 1 times [2019-11-15 21:01:18,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:18,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381229263] [2019-11-15 21:01:18,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:18,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:18,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:01:18,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381229263] [2019-11-15 21:01:18,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978279458] [2019-11-15 21:01:18,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_442600df-669d-4cdf-bfcb-ef0ef1e043ae/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:01:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:18,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 21:01:18,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:01:18,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 21:01:18,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:01:18,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 21:01:18,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:01:18,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:01:18,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:19 [2019-11-15 21:01:18,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-11-15 21:01:18,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:01:18,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:01:18,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-15 21:01:18,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:01:18,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:01:18,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:01:18,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 35 [2019-11-15 21:01:18,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:01:18,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:01:18,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:334, output treesize:52 [2019-11-15 21:01:18,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:18,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2019-11-15 21:01:18,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:18,952 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:01:18,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:18,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:01:18,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:17 [2019-11-15 21:01:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:01:19,018 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:01:19,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-15 21:01:19,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096690938] [2019-11-15 21:01:19,275 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-11-15 21:01:19,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:01:19,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:01:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:01:19,321 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 16 states. [2019-11-15 21:01:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:01:19,823 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-11-15 21:01:19,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:01:19,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-15 21:01:19,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 21:01:19,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 21:01:19,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-15 21:01:19,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 21:01:19,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-15 21:01:19,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:01:19,826 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 21:01:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-15 21:01:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 21:01:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 21:01:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-11-15 21:01:19,828 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 21:01:19,829 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-15 21:01:19,829 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:01:19,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2019-11-15 21:01:19,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:01:19,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:01:19,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:01:19,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:01:19,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:01:19,831 INFO L791 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~mem24, main_#t~mem7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6; 363#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 376#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 382#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 380#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 377#L554-2 [2019-11-15 21:01:19,831 INFO L793 eck$LassoCheckResult]: Loop: 377#L554-2 assume 0 != main_#t~nondet14;havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem15 + main_#t~mem16, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem17;call main_#t~mem18 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem19 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 + main_#t~mem19, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;havoc main_#t~mem19; 375#L556-1 call main_#t~mem7 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short9 := main_#t~mem7 > 0; 369#L553-1 assume main_#t~short9;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 370#L553-3 assume !!main_#t~short9;havoc main_#t~mem7;havoc main_#t~short9;havoc main_#t~mem8;call main_#t~mem10 := read~int(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4); 373#L554 assume !(main_#t~mem10 > main_#t~mem11);havoc main_#t~mem10;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem13; 377#L554-2 [2019-11-15 21:01:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 2 times [2019-11-15 21:01:19,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:19,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080702178] [2019-11-15 21:01:19,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:19,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:19,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:19,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 53782946, now seen corresponding path program 1 times [2019-11-15 21:01:19,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:19,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696764761] [2019-11-15 21:01:19,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:19,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:19,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:19,873 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -304168136, now seen corresponding path program 1 times [2019-11-15 21:01:19,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:01:19,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900243531] [2019-11-15 21:01:19,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:19,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:01:19,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:01:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:01:19,905 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:01:20,144 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-11-15 21:01:20,494 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2019-11-15 21:01:20,605 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 21:01:20,608 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:01:20,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:01:20,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:01:20,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:01:20,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:01:20,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:01:20,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:01:20,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:01:20,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: min_rf-alloca.i_Iteration4_Lasso [2019-11-15 21:01:20,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:01:20,609 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:01:20,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:20,977 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-11-15 21:01:21,105 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 21:01:21,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:01:21,686 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 21:01:21,861 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:01:21,862 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:01:21,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,866 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,867 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,867 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,868 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:21,869 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:21,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,880 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,882 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,887 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:21,887 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:21,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,891 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,895 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:01:21,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:01:21,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:01:21,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,899 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 21:01:21,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,903 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 21:01:21,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:21,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:21,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:21,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:01:21,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:01:21,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:01:21,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:01:21,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:01:21,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:01:21,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:01:21,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:01:21,947 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:01:21,956 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:01:21,957 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:01:21,957 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:01:21,958 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:01:21,958 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:01:21,959 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-11-15 21:01:22,039 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 21:01:22,043 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:01:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:01:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:22,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:01:22,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:01:22,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:22,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 21:01:22,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:01:22,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:22,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:01:22,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 21:01:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:01:22,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:01:22,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:01:22,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:01:22,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:01:22,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:01:22,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 271 treesize of output 149 [2019-11-15 21:01:22,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:01:22,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:01:22,436 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.constructTraceCheck(RefineBuchi.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:208) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:01:22,443 INFO L168 Benchmark]: Toolchain (without parser) took 9892.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -239.8 MB). Peak memory consumption was 266.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:01:22,445 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:01:22,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:01:22,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.00 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. [2019-11-15 21:01:22,447 INFO L168 Benchmark]: Boogie Preprocessor took 24.25 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. [2019-11-15 21:01:22,448 INFO L168 Benchmark]: RCFGBuilder took 364.56 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.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:01:22,448 INFO L168 Benchmark]: BuchiAutomizer took 8929.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.0 MB). Peak memory consumption was 282.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:01:22,454 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 529.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.25 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 364.56 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.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8929.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.0 MB). Peak memory consumption was 282.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...