./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum05.i -s /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/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 32bit --witnessprinter.graph.data.programhash 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:54:40,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:54:40,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:54:40,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:54:40,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:54:40,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:54:40,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:54:40,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:54:40,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:54:40,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:54:40,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:54:40,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:54:40,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:54:40,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:54:40,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:54:40,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:54:40,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:54:40,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:54:40,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:54:40,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:54:40,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:54:40,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:54:40,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:54:40,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:54:40,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:54:40,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:54:40,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:54:40,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:54:40,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:54:40,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:54:40,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:54:40,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:54:40,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:54:40,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:54:40,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:54:40,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:54:40,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:54:40,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:54:40,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:54:40,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:54:40,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:54:40,800 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:54:40,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:54:40,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:54:40,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:54:40,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:54:40,837 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:54:40,837 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:54:40,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:54:40,838 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:54:40,838 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:54:40,838 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:54:40,839 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:54:40,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:54:40,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:54:40,839 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:54:40,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:54:40,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:54:40,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:54:40,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:54:40,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:54:40,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:54:40,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:54:40,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:54:40,842 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:54:40,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:54:40,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:54:40,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:54:40,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:54:40,843 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:54:40,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:54:40,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:54:40,844 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:54:40,845 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:54:40,845 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_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1633e43e3f340ce4ae371cafc3d1ea0a9dad5739 [2019-11-25 08:54:41,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:54:41,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:54:41,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:54:41,028 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:54:41,029 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:54:41,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum05.i [2019-11-25 08:54:41,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/data/7ab31597a/98efd71446eb42699d6bd524361e591b/FLAG164cd643a [2019-11-25 08:54:41,573 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:54:41,573 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/sv-benchmarks/c/reducercommutativity/rangesum05.i [2019-11-25 08:54:41,582 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/data/7ab31597a/98efd71446eb42699d6bd524361e591b/FLAG164cd643a [2019-11-25 08:54:41,944 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/data/7ab31597a/98efd71446eb42699d6bd524361e591b [2019-11-25 08:54:41,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:54:41,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:54:41,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:41,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:54:41,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:54:41,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:41" (1/1) ... [2019-11-25 08:54:41,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1968b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:41, skipping insertion in model container [2019-11-25 08:54:41,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:41" (1/1) ... [2019-11-25 08:54:41,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:54:41,993 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:54:42,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:42,384 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:54:42,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:42,446 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:54:42,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42 WrapperNode [2019-11-25 08:54:42,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:42,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:54:42,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:54:42,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:54:42,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:54:42,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:54:42,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:54:42,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:54:42,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... [2019-11-25 08:54:42,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:54:42,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:54:42,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:54:42,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:54:42,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/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-25 08:54:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:54:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:54:42,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:54:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:54:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:54:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:54:43,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:54:43,042 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-25 08:54:43,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:43 BoogieIcfgContainer [2019-11-25 08:54:43,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:54:43,044 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:54:43,044 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:54:43,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:54:43,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:54:43,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:54:41" (1/3) ... [2019-11-25 08:54:43,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d8d99b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:54:43, skipping insertion in model container [2019-11-25 08:54:43,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:54:43,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:42" (2/3) ... [2019-11-25 08:54:43,051 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d8d99b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:54:43, skipping insertion in model container [2019-11-25 08:54:43,051 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:54:43,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:43" (3/3) ... [2019-11-25 08:54:43,065 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum05.i [2019-11-25 08:54:43,114 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:54:43,114 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:54:43,115 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:54:43,115 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:54:43,115 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:54:43,115 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:54:43,115 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:54:43,116 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:54:43,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-11-25 08:54:43,154 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-25 08:54:43,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:43,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:43,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:54:43,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:54:43,160 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:54:43,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-11-25 08:54:43,163 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-25 08:54:43,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:43,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:43,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-25 08:54:43,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:54:43,172 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 26#L6-3true [2019-11-25 08:54:43,172 INFO L796 eck$LassoCheckResult]: Loop: 26#L6-3true assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 30#L6-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 26#L6-3true [2019-11-25 08:54:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-25 08:54:43,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:43,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713246283] [2019-11-25 08:54:43,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:43,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-25 08:54:43,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:43,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252940367] [2019-11-25 08:54:43,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:43,327 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-25 08:54:43,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:43,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369134158] [2019-11-25 08:54:43,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:43,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:43,606 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-25 08:54:43,688 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:54:43,689 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:54:43,689 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:54:43,689 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:54:43,690 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:54:43,690 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:43,690 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:54:43,690 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:54:43,690 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration1_Lasso [2019-11-25 08:54:43,691 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:54:43,691 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:54:43,728 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-25 08:54:43,735 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-25 08:54:43,738 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-25 08:54:43,742 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-25 08:54:43,755 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-25 08:54:43,760 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-25 08:54:43,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-25 08:54:43,930 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-25 08:54:43,933 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-25 08:54:43,941 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-25 08:54:43,944 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-25 08:54:43,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-25 08:54:43,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-25 08:54:43,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-25 08:54:43,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-25 08:54:43,963 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-25 08:54:43,966 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-25 08:54:43,969 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-25 08:54:44,314 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:54:44,323 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,334 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-25 08:54:44,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:54:44,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:54:44,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,372 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-25 08:54:44,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:54:44,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:54:44,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,400 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-25 08:54:44,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:54:44,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:54:44,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:54:44,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,429 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-25 08:54:44,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:44,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,473 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-25 08:54:44,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:54:44,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:54:44,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,497 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-25 08:54:44,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:44,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:44,542 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-25 08:54:44,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:44,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:44,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:44,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:44,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:44,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:54:44,658 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-25 08:54:44,658 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:44,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:54:44,703 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:54:44,703 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:54:44,704 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_init_nondet_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0 Supporting invariants [] [2019-11-25 08:54:44,809 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-25 08:54:44,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:54:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:44,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:44,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:44,923 WARN L253 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:54:44,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:44,965 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-25 08:54:44,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:54:44,986 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-11-25 08:54:45,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 75 states and 119 transitions. Complement of second has 8 states. [2019-11-25 08:54:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:54:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:54:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-11-25 08:54:45,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-25 08:54:45,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-25 08:54:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-25 08:54:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:45,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2019-11-25 08:54:45,153 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2019-11-25 08:54:45,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-25 08:54:45,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-25 08:54:45,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2019-11-25 08:54:45,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:45,161 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-11-25 08:54:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2019-11-25 08:54:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-25 08:54:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:54:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-11-25 08:54:45,194 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-11-25 08:54:45,194 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-11-25 08:54:45,194 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:54:45,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2019-11-25 08:54:45,195 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:45,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:45,196 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-25 08:54:45,196 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:45,197 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 174#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 175#L6-3 assume !(init_nondet_~i~0 < 5); 178#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 161#L17-3 [2019-11-25 08:54:45,197 INFO L796 eck$LassoCheckResult]: Loop: 161#L17-3 assume !!(rangesum_~i~1 < 5); 169#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 160#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 161#L17-3 [2019-11-25 08:54:45,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,197 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-25 08:54:45,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997694792] [2019-11-25 08:54:45,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,272 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-25 08:54:45,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997694792] [2019-11-25 08:54:45,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:45,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:45,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429404152] [2019-11-25 08:54:45,278 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-11-25 08:54:45,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224092978] [2019-11-25 08:54:45,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:45,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:45,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:45,378 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-25 08:54:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:45,396 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-11-25 08:54:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:45,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-11-25 08:54:45,401 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2019-11-25 08:54:45,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-25 08:54:45,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-25 08:54:45,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-11-25 08:54:45,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:45,403 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-25 08:54:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-11-25 08:54:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-25 08:54:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-25 08:54:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-11-25 08:54:45,411 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-25 08:54:45,412 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-25 08:54:45,412 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:54:45,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-11-25 08:54:45,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:45,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:45,416 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-25 08:54:45,416 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:45,417 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 225#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 226#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 229#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 230#L6-3 assume !(init_nondet_~i~0 < 5); 231#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 212#L17-3 [2019-11-25 08:54:45,417 INFO L796 eck$LassoCheckResult]: Loop: 212#L17-3 assume !!(rangesum_~i~1 < 5); 220#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 211#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 212#L17-3 [2019-11-25 08:54:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-25 08:54:45,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116715776] [2019-11-25 08:54:45,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:45,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116715776] [2019-11-25 08:54:45,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147896520] [2019-11-25 08:54:45,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:45,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:45,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:45,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-25 08:54:45,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337415627] [2019-11-25 08:54:45,554 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,554 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-11-25 08:54:45,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645901641] [2019-11-25 08:54:45,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:45,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:45,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:54:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:45,642 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-25 08:54:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:45,667 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-11-25 08:54:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:45,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-11-25 08:54:45,671 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-11-25 08:54:45,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-25 08:54:45,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-25 08:54:45,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-25 08:54:45,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:45,673 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-25 08:54:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-25 08:54:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-25 08:54:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-25 08:54:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-25 08:54:45,679 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-25 08:54:45,679 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-25 08:54:45,680 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:54:45,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-25 08:54:45,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:45,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:45,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-25 08:54:45,686 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:45,686 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 295#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 296#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 299#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 300#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 301#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 304#L6-3 assume !(init_nondet_~i~0 < 5); 303#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 282#L17-3 [2019-11-25 08:54:45,687 INFO L796 eck$LassoCheckResult]: Loop: 282#L17-3 assume !!(rangesum_~i~1 < 5); 290#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 281#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 282#L17-3 [2019-11-25 08:54:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,687 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-25 08:54:45,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567335193] [2019-11-25 08:54:45,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,751 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-25 08:54:45,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567335193] [2019-11-25 08:54:45,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393670899] [2019-11-25 08:54:45,752 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:45,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:45,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:45,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:45,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:45,823 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-25 08:54:45,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:45,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-25 08:54:45,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287421542] [2019-11-25 08:54:45,825 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-11-25 08:54:45,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470886647] [2019-11-25 08:54:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:45,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:45,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:45,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:45,906 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-25 08:54:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:45,934 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-25 08:54:45,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:45,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-25 08:54:45,936 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2019-11-25 08:54:45,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-25 08:54:45,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-25 08:54:45,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-25 08:54:45,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:45,938 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-25 08:54:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-25 08:54:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-25 08:54:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-25 08:54:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-25 08:54:45,941 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-25 08:54:45,942 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-25 08:54:45,942 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:54:45,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-25 08:54:45,943 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:45,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:45,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:45,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-25 08:54:45,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:45,945 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 377#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 380#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 384#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 387#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 381#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 382#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 386#L6-3 assume !(init_nondet_~i~0 < 5); 385#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 363#L17-3 [2019-11-25 08:54:45,945 INFO L796 eck$LassoCheckResult]: Loop: 363#L17-3 assume !!(rangesum_~i~1 < 5); 371#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 362#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 363#L17-3 [2019-11-25 08:54:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-25 08:54:45,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320228555] [2019-11-25 08:54:45,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:45,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320228555] [2019-11-25 08:54:46,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743807545] [2019-11-25 08:54:46,000 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:46,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-25 08:54:46,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:46,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:54:46,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:46,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:46,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-25 08:54:46,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030594683] [2019-11-25 08:54:46,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-11-25 08:54:46,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202143818] [2019-11-25 08:54:46,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:46,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:46,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:46,170 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-25 08:54:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:46,206 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-25 08:54:46,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:54:46,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-25 08:54:46,211 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:46,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2019-11-25 08:54:46,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-25 08:54:46,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-25 08:54:46,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-25 08:54:46,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:46,213 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-25 08:54:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-25 08:54:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-25 08:54:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:54:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-25 08:54:46,221 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-25 08:54:46,221 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-25 08:54:46,221 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:54:46,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-25 08:54:46,223 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:46,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:46,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:46,227 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-25 08:54:46,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:46,228 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 468#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 469#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 472#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 473#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 474#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 476#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 481#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 480#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 479#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 478#L6-3 assume !(init_nondet_~i~0 < 5); 477#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 455#L17-3 [2019-11-25 08:54:46,228 INFO L796 eck$LassoCheckResult]: Loop: 455#L17-3 assume !!(rangesum_~i~1 < 5); 463#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 454#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 455#L17-3 [2019-11-25 08:54:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-25 08:54:46,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568580041] [2019-11-25 08:54:46,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:46,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568580041] [2019-11-25 08:54:46,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147979944] [2019-11-25 08:54:46,337 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:46,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:54:46,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:46,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:46,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:46,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:46,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-25 08:54:46,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616996427] [2019-11-25 08:54:46,434 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-11-25 08:54:46,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805145912] [2019-11-25 08:54:46,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,464 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:46,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:54:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:46,549 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-11-25 08:54:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:46,589 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-25 08:54:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:46,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-25 08:54:46,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:46,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2019-11-25 08:54:46,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-25 08:54:46,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-25 08:54:46,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-11-25 08:54:46,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:46,595 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-25 08:54:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-11-25 08:54:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-25 08:54:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-25 08:54:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-25 08:54:46,605 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-25 08:54:46,605 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-25 08:54:46,605 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:54:46,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-25 08:54:46,606 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:46,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:46,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:46,607 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-25 08:54:46,608 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:46,608 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 570#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 571#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 575#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 576#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 585#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 584#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 583#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 582#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 581#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 579#L6-3 assume !(init_nondet_~i~0 < 5); 578#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 557#L17-3 [2019-11-25 08:54:46,608 INFO L796 eck$LassoCheckResult]: Loop: 557#L17-3 assume !!(rangesum_~i~1 < 5); 565#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 556#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 557#L17-3 [2019-11-25 08:54:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-25 08:54:46,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783277972] [2019-11-25 08:54:46,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-11-25 08:54:46,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951501354] [2019-11-25 08:54:46,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2019-11-25 08:54:46,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379509264] [2019-11-25 08:54:46,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-25 08:54:46,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379509264] [2019-11-25 08:54:46,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:46,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:46,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444540470] [2019-11-25 08:54:46,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:46,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:46,797 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-25 08:54:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:46,854 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-11-25 08:54:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:46,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-11-25 08:54:46,855 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:46,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2019-11-25 08:54:46,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-25 08:54:46,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-25 08:54:46,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2019-11-25 08:54:46,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:46,857 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-11-25 08:54:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2019-11-25 08:54:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-25 08:54:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:54:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-11-25 08:54:46,860 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-25 08:54:46,860 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-25 08:54:46,861 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:54:46,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-11-25 08:54:46,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:46,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:46,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:46,862 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:46,862 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:46,862 INFO L794 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 648#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 649#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 653#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 654#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 655#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 658#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 667#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 665#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 664#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 663#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 661#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 660#L6-3 assume !(init_nondet_~i~0 < 5); 659#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 656#L17-3 assume !!(rangesum_~i~1 < 5); 643#L18 assume !(rangesum_~i~1 > 2); 633#L17-2 [2019-11-25 08:54:46,863 INFO L796 eck$LassoCheckResult]: Loop: 633#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 634#L17-3 assume !!(rangesum_~i~1 < 5); 666#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 633#L17-2 [2019-11-25 08:54:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2019-11-25 08:54:46,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041769578] [2019-11-25 08:54:46,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2019-11-25 08:54:46,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146740607] [2019-11-25 08:54:46,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:46,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2019-11-25 08:54:46,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:46,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696169075] [2019-11-25 08:54:46,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-25 08:54:47,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696169075] [2019-11-25 08:54:47,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227808293] [2019-11-25 08:54:47,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:47,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:47,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-25 08:54:47,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:47,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-25 08:54:47,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183898509] [2019-11-25 08:54:47,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:47,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:54:47,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:47,146 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-25 08:54:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:47,225 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-25 08:54:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:47,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2019-11-25 08:54:47,227 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:47,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2019-11-25 08:54:47,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-25 08:54:47,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-25 08:54:47,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2019-11-25 08:54:47,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:47,229 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-11-25 08:54:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2019-11-25 08:54:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-25 08:54:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-25 08:54:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-25 08:54:47,236 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-25 08:54:47,236 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-25 08:54:47,236 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-25 08:54:47,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-11-25 08:54:47,237 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:47,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:47,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:47,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1] [2019-11-25 08:54:47,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:47,240 INFO L794 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 798#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 799#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 803#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 804#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 805#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 808#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 821#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 820#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 816#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 815#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 814#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 813#L6-3 assume !(init_nondet_~i~0 < 5); 809#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 810#L17-3 assume !!(rangesum_~i~1 < 5); 822#L18 assume !(rangesum_~i~1 > 2); 781#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 782#L17-3 assume !!(rangesum_~i~1 < 5); 791#L18 assume !(rangesum_~i~1 > 2); 792#L17-2 [2019-11-25 08:54:47,240 INFO L796 eck$LassoCheckResult]: Loop: 792#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 818#L17-3 assume !!(rangesum_~i~1 < 5); 819#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 792#L17-2 [2019-11-25 08:54:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813622, now seen corresponding path program 1 times [2019-11-25 08:54:47,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237680461] [2019-11-25 08:54:47,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 8 times [2019-11-25 08:54:47,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392841234] [2019-11-25 08:54:47,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808232, now seen corresponding path program 2 times [2019-11-25 08:54:47,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691009595] [2019-11-25 08:54:47,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-25 08:54:47,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691009595] [2019-11-25 08:54:47,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552499872] [2019-11-25 08:54:47,374 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:47,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:47,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:47,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:47,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-25 08:54:47,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-25 08:54:47,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874368428] [2019-11-25 08:54:47,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:47,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:47,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:47,516 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-25 08:54:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:47,600 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-25 08:54:47,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:47,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-11-25 08:54:47,602 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-25 08:54:47,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2019-11-25 08:54:47,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-25 08:54:47,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-25 08:54:47,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2019-11-25 08:54:47,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:54:47,603 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-25 08:54:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2019-11-25 08:54:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-25 08:54:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 08:54:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-25 08:54:47,608 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-25 08:54:47,608 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-25 08:54:47,608 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-25 08:54:47,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-11-25 08:54:47,609 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:47,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:47,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:47,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2019-11-25 08:54:47,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:47,610 INFO L794 eck$LassoCheckResult]: Stem: 975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 972#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 973#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 977#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 978#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 979#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 998#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 996#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 993#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 992#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 990#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 987#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 986#L6-3 assume !(init_nondet_~i~0 < 5); 983#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 984#L17-3 assume !!(rangesum_~i~1 < 5); 967#L18 assume !(rangesum_~i~1 > 2); 957#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 958#L17-3 assume !!(rangesum_~i~1 < 5); 980#L18 assume !(rangesum_~i~1 > 2); 1001#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1000#L17-3 assume !!(rangesum_~i~1 < 5); 999#L18 assume !(rangesum_~i~1 > 2); 997#L17-2 [2019-11-25 08:54:47,610 INFO L796 eck$LassoCheckResult]: Loop: 997#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 994#L17-3 assume !!(rangesum_~i~1 < 5); 995#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 997#L17-2 [2019-11-25 08:54:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 2 times [2019-11-25 08:54:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622368628] [2019-11-25 08:54:47,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 9 times [2019-11-25 08:54:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864495470] [2019-11-25 08:54:47,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,664 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 3 times [2019-11-25 08:54:47,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556758405] [2019-11-25 08:54:47,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:47,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:48,700 WARN L192 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 119 [2019-11-25 08:54:48,819 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-25 08:54:48,823 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:54:48,823 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:54:48,823 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:54:48,823 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:54:48,823 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:54:48,824 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:48,824 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:54:48,824 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:54:48,824 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration10_Lasso [2019-11-25 08:54:48,824 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:54:48,824 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:54:48,828 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-25 08:54:48,966 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-25 08:54:49,050 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-25 08:54:49,053 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-25 08:54:49,056 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-25 08:54:49,060 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-25 08:54:49,063 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-25 08:54:49,068 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-25 08:54:49,071 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-25 08:54:49,073 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-25 08:54:49,076 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-25 08:54:49,080 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-25 08:54:49,083 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-25 08:54:49,086 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-25 08:54:49,094 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-25 08:54:49,097 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-25 08:54:49,099 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-25 08:54:49,102 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-25 08:54:49,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-25 08:54:49,111 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-25 08:54:49,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-25 08:54:49,119 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-25 08:54:49,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-25 08:54:49,130 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-25 08:54:49,486 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:54:49,487 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:49,495 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-25 08:54:49,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:49,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:49,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:49,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:49,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:49,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:54:49,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:49,540 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-25 08:54:49,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:49,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:49,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:49,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:49,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:49,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:49,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:49,568 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-25 08:54:49,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:49,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:49,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:49,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:49,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:49,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:54:49,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:49,592 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-25 08:54:49,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:49,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:49,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:49,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:49,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:49,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:54:49,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:49,627 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-25 08:54:49,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:49,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:49,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:49,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:49,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:54:49,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:54:49,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:54:49,711 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2019-11-25 08:54:49,712 INFO L444 ModelExtractionUtils]: 16 out of 34 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:49,720 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:54:49,723 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:54:49,724 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:54:49,724 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 7 Supporting invariants [] [2019-11-25 08:54:49,747 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-25 08:54:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:49,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:49,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:49,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:49,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:49,836 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-25 08:54:49,836 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-25 08:54:49,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-25 08:54:49,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 61 states and 73 transitions. Complement of second has 7 states. [2019-11-25 08:54:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:54:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:54:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-25 08:54:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-25 08:54:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-25 08:54:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-25 08:54:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:49,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-11-25 08:54:49,891 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-25 08:54:49,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2019-11-25 08:54:49,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-25 08:54:49,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-25 08:54:49,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-25 08:54:49,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:54:49,892 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-25 08:54:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-25 08:54:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-25 08:54:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 08:54:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-25 08:54:49,896 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-25 08:54:49,896 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-25 08:54:49,896 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-25 08:54:49,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-11-25 08:54:49,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-25 08:54:49,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:49,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:49,899 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:49,899 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:49,900 INFO L794 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1211#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1212#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1216#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1217#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1218#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1240#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1239#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1238#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1237#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1236#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1235#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1234#L6-3 assume !(init_nondet_~i~0 < 5); 1221#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1219#L17-3 assume !!(rangesum_~i~1 < 5); 1204#L18 assume !(rangesum_~i~1 > 2); 1192#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1193#L17-3 assume !!(rangesum_~i~1 < 5); 1205#L18 assume !(rangesum_~i~1 > 2); 1206#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1231#L17-3 assume !!(rangesum_~i~1 < 5); 1229#L18 assume !(rangesum_~i~1 > 2); 1226#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1224#L17-3 assume !(rangesum_~i~1 < 5); 1215#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1196#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1197#L17-8 assume !!(rangesum_~i~1 < 5); 1200#L18-2 assume !(rangesum_~i~1 > 2); 1201#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1213#L17-8 assume !!(rangesum_~i~1 < 5); 1233#L18-2 assume !(rangesum_~i~1 > 2); 1232#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1230#L17-8 assume !!(rangesum_~i~1 < 5); 1227#L18-2 assume !(rangesum_~i~1 > 2); 1225#L17-7 [2019-11-25 08:54:49,900 INFO L796 eck$LassoCheckResult]: Loop: 1225#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1222#L17-8 assume !!(rangesum_~i~1 < 5); 1223#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1225#L17-7 [2019-11-25 08:54:49,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2019-11-25 08:54:49,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:49,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363095881] [2019-11-25 08:54:49,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-25 08:54:49,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363095881] [2019-11-25 08:54:49,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:49,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:54:49,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730122544] [2019-11-25 08:54:49,933 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2019-11-25 08:54:49,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:49,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278952518] [2019-11-25 08:54:49,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:49,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:49,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:49,995 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-25 08:54:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:50,056 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-11-25 08:54:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:50,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-11-25 08:54:50,058 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-25 08:54:50,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2019-11-25 08:54:50,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-25 08:54:50,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-25 08:54:50,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2019-11-25 08:54:50,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:54:50,060 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-25 08:54:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2019-11-25 08:54:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-11-25 08:54:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 08:54:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-11-25 08:54:50,064 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-11-25 08:54:50,064 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-11-25 08:54:50,064 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-25 08:54:50,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2019-11-25 08:54:50,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-25 08:54:50,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:50,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:50,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:50,067 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:50,067 INFO L794 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1345#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1346#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1350#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1351#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1352#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1358#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1371#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1370#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1369#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1368#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1366#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1365#L6-3 assume !(init_nondet_~i~0 < 5); 1359#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1353#L17-3 assume !!(rangesum_~i~1 < 5); 1338#L18 assume !(rangesum_~i~1 > 2); 1326#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1327#L17-3 assume !!(rangesum_~i~1 < 5); 1376#L18 assume !(rangesum_~i~1 > 2); 1377#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1378#L17-3 assume !!(rangesum_~i~1 < 5); 1339#L18 assume !(rangesum_~i~1 > 2); 1328#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1329#L17-3 assume !!(rangesum_~i~1 < 5); 1354#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1364#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1362#L17-3 assume !(rangesum_~i~1 < 5); 1349#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1330#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1331#L17-8 assume !!(rangesum_~i~1 < 5); 1375#L18-2 assume !(rangesum_~i~1 > 2); 1347#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1344#L17-8 assume !!(rangesum_~i~1 < 5); 1334#L18-2 assume !(rangesum_~i~1 > 2); 1335#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1374#L17-8 assume !!(rangesum_~i~1 < 5); 1373#L18-2 assume !(rangesum_~i~1 > 2); 1367#L17-7 [2019-11-25 08:54:50,067 INFO L796 eck$LassoCheckResult]: Loop: 1367#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1372#L17-8 assume !!(rangesum_~i~1 < 5); 1361#L18-2 assume !(rangesum_~i~1 > 2); 1367#L17-7 [2019-11-25 08:54:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2019-11-25 08:54:50,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:50,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834650724] [2019-11-25 08:54:50,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-25 08:54:50,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834650724] [2019-11-25 08:54:50,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402624875] [2019-11-25 08:54:50,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:50,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:50,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-11-25 08:54:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-25 08:54:50,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:50,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-25 08:54:50,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658982593] [2019-11-25 08:54:50,220 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2019-11-25 08:54:50,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:50,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330791445] [2019-11-25 08:54:50,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:50,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:50,262 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:54:50,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:54:50,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:54:50,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:54:50,262 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-25 08:54:50,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:54:50,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:54:50,263 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Loop [2019-11-25 08:54:50,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:54:50,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:54:50,264 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-25 08:54:50,268 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-25 08:54:50,293 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:54:50,294 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:54:50,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:54:50,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-25 08:54:50,308 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post2=0} Honda state: {ULTIMATE.start_rangesum_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-25 08:54:50,314 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-25 08:54:50,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-25 08:54:50,393 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-25 08:54:50,394 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:54:50,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:54:50,395 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:54:50,395 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:54:50,395 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:54:50,395 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:54:50,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:54:50,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Loop [2019-11-25 08:54:50,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:54:50,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:54:50,396 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-25 08:54:50,404 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-25 08:54:50,430 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:54:50,430 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:50,444 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-25 08:54:50,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:50,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:54:50,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:50,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:50,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:50,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:54:50,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:50,463 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-25 08:54:50,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:54:50,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:54:50,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:54:50,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:54:50,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:54:50,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:54:50,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:54:50,474 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-25 08:54:50,474 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:54:50,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:54:50,481 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-25 08:54:50,482 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:54:50,482 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 3 Supporting invariants [] [2019-11-25 08:54:50,493 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:54:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:50,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:50,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:50,563 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:50,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:50,573 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-25 08:54:50,574 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-25 08:54:50,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-25 08:54:50,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 71 states and 83 transitions. Complement of second has 5 states. [2019-11-25 08:54:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:54:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:54:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-11-25 08:54:50,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-25 08:54:50,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:50,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2019-11-25 08:54:50,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:50,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2019-11-25 08:54:50,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:54:50,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2019-11-25 08:54:50,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-25 08:54:50,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2019-11-25 08:54:50,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-25 08:54:50,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-25 08:54:50,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2019-11-25 08:54:50,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:54:50,624 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-25 08:54:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2019-11-25 08:54:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-25 08:54:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:54:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-25 08:54:50,633 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-25 08:54:50,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:50,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:50,635 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 4 states. [2019-11-25 08:54:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:50,672 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2019-11-25 08:54:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:50,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 85 transitions. [2019-11-25 08:54:50,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-25 08:54:50,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 85 transitions. [2019-11-25 08:54:50,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-25 08:54:50,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-25 08:54:50,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 85 transitions. [2019-11-25 08:54:50,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:54:50,676 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-11-25 08:54:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 85 transitions. [2019-11-25 08:54:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2019-11-25 08:54:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:54:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-11-25 08:54:50,683 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-25 08:54:50,683 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-25 08:54:50,683 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-25 08:54:50,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 69 transitions. [2019-11-25 08:54:50,684 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-25 08:54:50,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:50,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:50,686 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:50,686 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:50,686 INFO L794 eck$LassoCheckResult]: Stem: 1869#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1864#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1865#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1871#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1872#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1873#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1891#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1890#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1889#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1888#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1887#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1886#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1885#L6-3 assume !(init_nondet_~i~0 < 5); 1879#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1880#L17-3 assume !!(rangesum_~i~1 < 5); 1854#L18 assume !(rangesum_~i~1 > 2); 1840#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1841#L17-3 assume !!(rangesum_~i~1 < 5); 1875#L18 assume !(rangesum_~i~1 > 2); 1842#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1843#L17-3 assume !!(rangesum_~i~1 < 5); 1855#L18 assume !(rangesum_~i~1 > 2); 1856#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1892#L17-3 assume !!(rangesum_~i~1 < 5); 1883#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1882#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1874#L17-3 assume !(rangesum_~i~1 < 5); 1870#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 1844#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1845#L17-8 assume !!(rangesum_~i~1 < 5); 1884#L18-2 assume !(rangesum_~i~1 > 2); 1866#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1867#L17-8 assume !!(rangesum_~i~1 < 5); 1850#L18-2 assume !(rangesum_~i~1 > 2); 1851#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1895#L17-8 assume !!(rangesum_~i~1 < 5); 1894#L18-2 assume !(rangesum_~i~1 > 2); 1893#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1861#L17-8 assume !!(rangesum_~i~1 < 5); 1848#L18-2 [2019-11-25 08:54:50,686 INFO L796 eck$LassoCheckResult]: Loop: 1848#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1849#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1881#L17-8 assume !!(rangesum_~i~1 < 5); 1848#L18-2 [2019-11-25 08:54:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 734232641, now seen corresponding path program 1 times [2019-11-25 08:54:50,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:50,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327569922] [2019-11-25 08:54:50,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:50,707 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:54:50,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616040733] [2019-11-25 08:54:50,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:50,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:54:50,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-25 08:54:50,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327569922] [2019-11-25 08:54:50,826 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:54:50,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616040733] [2019-11-25 08:54:50,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:50,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-25 08:54:50,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892770909] [2019-11-25 08:54:50,827 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:54:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2019-11-25 08:54:50,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:50,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820485806] [2019-11-25 08:54:50,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:50,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:50,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:50,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:50,885 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-25 08:54:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:50,993 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-11-25 08:54:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:54:50,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. [2019-11-25 08:54:50,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-25 08:54:50,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 78 states and 89 transitions. [2019-11-25 08:54:50,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-25 08:54:50,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-25 08:54:50,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 89 transitions. [2019-11-25 08:54:50,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:54:50,996 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-11-25 08:54:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 89 transitions. [2019-11-25 08:54:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-11-25 08:54:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 08:54:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-11-25 08:54:51,000 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-11-25 08:54:51,000 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-11-25 08:54:51,000 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-25 08:54:51,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2019-11-25 08:54:51,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-25 08:54:51,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:51,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:51,002 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:51,003 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:54:51,003 INFO L794 eck$LassoCheckResult]: Stem: 2134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2129#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2130#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2136#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2137#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2138#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2163#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2161#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2159#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2158#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2157#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2155#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2154#L6-3 assume !(init_nondet_~i~0 < 5); 2144#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2145#L17-3 assume !!(rangesum_~i~1 < 5); 2119#L18 assume !(rangesum_~i~1 > 2); 2105#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2106#L17-3 assume !!(rangesum_~i~1 < 5); 2140#L18 assume !(rangesum_~i~1 > 2); 2107#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2108#L17-3 assume !!(rangesum_~i~1 < 5); 2120#L18 assume !(rangesum_~i~1 > 2); 2121#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2165#L17-3 assume !!(rangesum_~i~1 < 5); 2164#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2150#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2151#L17-3 assume !!(rangesum_~i~1 < 5); 2149#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2148#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2139#L17-3 assume !(rangesum_~i~1 < 5); 2135#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2109#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2110#L17-8 assume !!(rangesum_~i~1 < 5); 2156#L18-2 assume !(rangesum_~i~1 > 2); 2131#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2132#L17-8 assume !!(rangesum_~i~1 < 5); 2115#L18-2 assume !(rangesum_~i~1 > 2); 2116#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2166#L17-8 assume !!(rangesum_~i~1 < 5); 2162#L18-2 assume !(rangesum_~i~1 > 2); 2160#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2126#L17-8 assume !!(rangesum_~i~1 < 5); 2113#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2114#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2153#L17-8 assume !!(rangesum_~i~1 < 5); 2147#L18-2 [2019-11-25 08:54:51,003 INFO L796 eck$LassoCheckResult]: Loop: 2147#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2152#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2146#L17-8 assume !!(rangesum_~i~1 < 5); 2147#L18-2 [2019-11-25 08:54:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2019-11-25 08:54:51,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:51,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996759989] [2019-11-25 08:54:51,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:51,012 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:54:51,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67949365] [2019-11-25 08:54:51,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,142 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2019-11-25 08:54:51,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:51,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235544512] [2019-11-25 08:54:51,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2019-11-25 08:54:51,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:51,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271641134] [2019-11-25 08:54:51,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:51,158 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:54:51,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142280909] [2019-11-25 08:54:51,159 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:51,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:54:51,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:51,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:51,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-25 08:54:51,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271641134] [2019-11-25 08:54:51,253 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-25 08:54:51,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142280909] [2019-11-25 08:54:51,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:51,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:54:51,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62527631] [2019-11-25 08:54:51,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:54:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:51,303 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-25 08:54:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:51,376 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-25 08:54:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:51,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2019-11-25 08:54:51,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:54:51,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2019-11-25 08:54:51,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-25 08:54:51,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-25 08:54:51,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2019-11-25 08:54:51,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:54:51,379 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-25 08:54:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2019-11-25 08:54:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-11-25 08:54:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-25 08:54:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-25 08:54:51,382 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-25 08:54:51,382 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-25 08:54:51,382 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-25 08:54:51,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2019-11-25 08:54:51,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:54:51,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:54:51,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:54:51,384 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:54:51,384 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:54:51,385 INFO L794 eck$LassoCheckResult]: Stem: 2425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2422#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 2423#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2427#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2428#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2429#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2456#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2455#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2454#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2453#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2452#L6-3 assume !!(init_nondet_~i~0 < 5);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2451#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2450#L6-3 assume !(init_nondet_~i~0 < 5); 2432#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2430#L17-3 assume !!(rangesum_~i~1 < 5); 2414#L18 assume !(rangesum_~i~1 > 2); 2401#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2402#L17-3 assume !!(rangesum_~i~1 < 5); 2415#L18 assume !(rangesum_~i~1 > 2); 2403#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2404#L17-3 assume !!(rangesum_~i~1 < 5); 2449#L18 assume !(rangesum_~i~1 > 2); 2446#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2448#L17-3 assume !!(rangesum_~i~1 < 5); 2445#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2443#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2441#L17-3 assume !!(rangesum_~i~1 < 5); 2439#L18 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2437#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2435#L17-3 assume !(rangesum_~i~1 < 5); 2426#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2405#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2406#L17-8 assume !!(rangesum_~i~1 < 5); 2409#L18-2 assume !(rangesum_~i~1 > 2); 2410#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2424#L17-8 assume !!(rangesum_~i~1 < 5); 2411#L18-2 assume !(rangesum_~i~1 > 2); 2412#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2420#L17-8 assume !!(rangesum_~i~1 < 5); 2421#L18-2 assume !(rangesum_~i~1 > 2); 2447#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2444#L17-8 assume !!(rangesum_~i~1 < 5); 2442#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2440#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2438#L17-8 assume !!(rangesum_~i~1 < 5); 2436#L18-2 assume rangesum_~i~1 > 2;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2434#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2433#L17-8 assume !(rangesum_~i~1 < 5); 2416#L17-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 2417#L26-1 main_#t~ret7 := rangesum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 2418#L43-3 [2019-11-25 08:54:51,385 INFO L796 eck$LassoCheckResult]: Loop: 2418#L43-3 assume !!(main_~i~2 < 4);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 2419#L43-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 2418#L43-3 [2019-11-25 08:54:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2019-11-25 08:54:51,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:51,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833899705] [2019-11-25 08:54:51,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:51,405 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:54:51,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841476580] [2019-11-25 08:54:51,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-11-25 08:54:51,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:51,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538181522] [2019-11-25 08:54:51,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:51,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2019-11-25 08:54:51,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:51,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117056068] [2019-11-25 08:54:51,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:51,566 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-25 08:54:51,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958366432] [2019-11-25 08:54:51,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79ecacc2-5154-40cc-b7e5-338e5ab4b71e/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:51,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:54,857 WARN L192 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 357 DAG size of output: 251 [2019-11-25 08:55:17,539 WARN L192 SmtUtils]: Spent 18.07 s on a formula simplification. DAG size of input: 450 DAG size of output: 150 [2019-11-25 08:55:17,543 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:55:17,543 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:55:17,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:55:17,544 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:55:17,544 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:55:17,544 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:55:17,544 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:55:17,544 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:55:17,544 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration15_Lasso [2019-11-25 08:55:17,544 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:55:17,544 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:55:17,546 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-25 08:55:17,673 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-25 08:55:17,679 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-25 08:55:17,681 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-25 08:55:17,683 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-25 08:55:17,686 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-25 08:55:17,688 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-25 08:55:17,983 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) 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-25 08:55:17,985 INFO L168 Benchmark]: Toolchain (without parser) took 36038.36 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 515.9 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 668.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:17,986 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:17,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:17,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.46 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-25 08:55:17,986 INFO L168 Benchmark]: Boogie Preprocessor took 48.36 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:17,987 INFO L168 Benchmark]: RCFGBuilder took 482.11 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: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:17,987 INFO L168 Benchmark]: BuchiAutomizer took 34940.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 373.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.8 MB). Peak memory consumption was 676.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:17,989 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.46 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 48.36 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 482.11 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: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34940.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 373.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.8 MB). Peak memory consumption was 676.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...